Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Da: Row By Row Bookshop, Sugar Grove, NC, U.S.A.
Prima edizione
Hardcover. Condizione: Good. Condizione sovraccoperta: No Dust Jacket. First Edition. An ex-library copy in original laminated pictorial hard covers of the 1999 second printing. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book.
Da: Anybook.com, Lincoln, Regno Unito
EUR 53,61
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9780849339882.
Da: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Prima edizione
Condizione: Good. First Edition. CRC Press, 1999. First edition, first printing with full number line; cover very lightly rubbed/bumped, corners ever-so-slightly rubbed, spine ends ever-so- slightly bumped; binding tight; cover, edges, and interior intact and clean except as noted. First Edition. hardcover. Good.
hardcover. Condizione: new.
Da: Buchpark, Trebbin, Germania
EUR 58,42
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Seiten: 344 | Sprache: Englisch | Produktart: Bücher | This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: -Combinations -Permutations -Graphs -Designs - Many classical areas are covered as well as new research topics not included in most existing texts, such as: -Group algorithms -Graph isomorphism -Hill-climbing -Heuristic search algorithms - This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.
Da: Chiron Media, Wallingford, Regno Unito
EUR 153,71
Quantità: 5 disponibili
Aggiungi al carrelloHardcover. Condizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 170,96
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 156,67
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 174,77
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 344.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 171,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 176,77
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Da: California Books, Miami, FL, U.S.A.
EUR 199,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 197,76
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 202,60
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 344.
Condizione: New. Satisfaction Guaranteed or your money back.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 240,64
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: Revaluation Books, Exeter, Regno Unito
EUR 261,62
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 329 pages. 9.75x6.75x1.25 inches. In Stock.
Da: Majestic Books, Hounslow, Regno Unito
EUR 180,75
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 344 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam This item is printed on demand.
Da: moluna, Greven, Germania
EUR 146,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Kreher, Donald L. Stinson, Douglas R.This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such a.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 206,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 201,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 211,10
Quantità: 5 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 254,16
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: -Combinations -Permutations -Graphs -Designs - Many classical areas are covered as well as new research topics not included in most existing texts, such as: -Group algorithms -Graph isomorphism -Hill-climbing -Heuristic search algorithms - This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.