This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance. Buy Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) “In the last years Korte and J. Vygen’s ‘Combinational Optimization. Buy Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) on by Bernhard Korte (Author), Jens Vygen ( Author).
|Published (Last):||1 October 2007|
|PDF File Size:||9.57 Mb|
|ePub File Size:||6.24 Mb|
|Price:||Free* [*Free Regsitration Required]|
Includes bibliographical references and indexes.
The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. These 9 locations in All: View online Borrow Buy Freely available Show 0 more links Not open to the public ; Springer Complete eBooks Archive pre Account Options Sign in.
My library Help Advanced Book Search. Found at these bookshops Searching – please wait Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization.
The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Be the first to add this to a list.
It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. The University of Melbourne. The book contains complete but concise proofs, also for many deep results, some The current volume by Korte and Vygen is a worthy successor.
Combinatorial Optimization – Bernhard Korte, Jens Vygen – Häftad () | Bokus
Computer science — Mathematics. Published Berlin ; New York: Second edition Technical Details Mode of access: Skickas inom vardagar specialorder. New exercises and updates in the bibliography were added.
The University of Queensland. Also available optimizatioj print. Open to the public ; Online: Furthermore there are several new sections and further material on various topics. Summary “This textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics.
Physical Description xiii, p. Skip to content Skip to search. Comments and reviews What are comments?
In order to set up a list of libraries that you have access to, you must first login or sign up. Bloggat om Combinatorial Optimization. Selected pages Page 7. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before.
Korte & Vygen, Combinatorial Optimization : Theory and Algorithms (3rd Edition)
Gonzalez Limited preview – Many very recent topics are covered as well, and many references are provided. Add a tag Cancel Be the first to add a tag for this edition. From the reviews of the 2nd edition: These 2 locations in Queensland: Other editions – View all Combinatorial Optimization: Contents Graphs Linear programming Linear programming algorithms Integer programming Spanning trees and arborescences Shortest paths Network flows Minimum cost flows Maximum matchings Weighted matching B-matchings and T-joins Matroids Generalizations of matroids NP-completeness Approximation algorithms The knapsack problem Bin-packing Multicommodity flows and edge-disjoint paths Network design problems The traveling salesman problem.
Skickas inom vardagar. Other editions – View all Combinatorial Optimization: The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before.