Condizione: New.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Condizione: As New. Unread book in perfect condition.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 84,11
Quantità: 3 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 76,75
Quantità: 6 disponibili
Aggiungi al carrelloCondizione: New.
Da: Majestic Books, Hounslow, Regno Unito
EUR 91,52
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 344.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 92,51
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: new.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 87,76
Quantità: 1 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Taylor & Francis Ltd, London, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. 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. Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Da: Chiron Media, Wallingford, Regno Unito
EUR 85,33
Quantità: 3 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 90,95
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 88,05
Quantità: 6 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 344.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condizione: New. 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: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Prima edizione
EUR 99,80
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. 2019. 1st Edition. Paperback. . . . . .
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 114,80
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: New. 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: Speedyhen, Hertfordshire, Regno Unito
EUR 76,76
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: NEW.
Condizione: New. 2019. 1st Edition. Paperback. . . . . . Books ship from the US and Ireland.
Da: Revaluation Books, Exeter, Regno Unito
EUR 133,20
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 344 pages. 9.21x6.14x0.87 inches. In Stock.
Da: moluna, Greven, Germania
EUR 95,15
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. 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.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
Paperback. Condizione: New. 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: Mispah books, Redhill, SURRE, Regno Unito
EUR 139,29
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: Taylor and Francis Ltd, GB, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: Rarewaves.com UK, London, Regno Unito
EUR 108,13
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: New. 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.
Lingua: Inglese
Editore: Taylor & Francis Ltd, London, 2019
ISBN 10: 0367400154 ISBN 13: 9780367400156
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 154,43
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. 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. Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 105,03
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 344.
Da: Revaluation Books, Exeter, Regno Unito
EUR 105,16
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 344 pages. 9.21x6.14x0.87 inches. In Stock. This item is printed on demand.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 98,00
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
Da: preigu, Osnabrück, Germania
EUR 111,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Combinatorial Algorithms | Generation, Enumeration, and Search | Donald L. Kreher (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2019 | CRC Press | EAN 9780367400156 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.