Rating
(5) · $69.22
It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise ...
Combinatorial Optimization4th edition ; Edition: 4th edition ; ISBN-13: 978-3540718437 ; Format: Hardback ; Publisher: Springer (10/18/2007) ; Copyright: 2008.
Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and ...
Missing: 978-3540718437 | Show results with:978-3540718437
We hope that our book will continue to serve its purpose in teaching and research in combinatorial optimization. Bonn, September 2011. Bernhard Korte and ...
Missing: 978-3540718437 | Show results with:978-3540718437
Rating
· $84.99
This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and ...
Missing: 978-3540718437 | Show results with:978-3540718437
People also ask
What is the best algorithm for combinatorial optimization?
What is combinatorial optimization in simple terms?
Is combinatorial optimization NP-hard?
What are the topics in combinatorial optimization?
This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, ...
Missing: 978-3540718437 | Show results with:978-3540718437
No information is available for this page. · Learn why
$28 to $96
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics). Bernhard Korte; Jens Vygen. ISBN 13: 9783540431541. Seller: Ergodebooks
$99.99
Mar 23, 2018 · Total: $0.00 ; Description. Well-written, popular textbook on combinatorial optimization. One of very few textbooks on this topic. Subject area ...
In order to show you the most relevant results, we have omitted some entries very similar to the 9 already displayed.
If you like, you can repeat the search with the omitted results included. |