skip to content
Combinatorial optimization : theory and algorithms Preview this item
ClosePreview this item
Checking...

Combinatorial optimization : theory and algorithms

Author: B H Korte; Jens Vygen
Publisher: Berlin : Springer, ©2008.
Series: Algorithms and combinatorics, 21.
Edition/Format:   eBook : Document : English : 4th edView all editions and formats
Database:WorldCat
Summary:
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before.  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Korte, B.H. (Bernhard H.), 1938-
Combinatorial optimization.
Berlin : Springer, c2008
(DLC) 2007936375
(OCoLC)181087916
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: B H Korte; Jens Vygen
ISBN: 9783540718444 3540718443 3540718435 9783540718437
OCLC Number: 261324708
Description: 1 online resource (xvii, 627 p.) : ill.
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 --
Facility location.
Series Title: Algorithms and combinatorics, 21.
Responsibility: Bernhard Korte, Jens Vygen.

Abstract:

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/261324708>
library:oclcnum"261324708"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/261324708>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:author
schema:bookEdition"4th ed."
schema:bookFormatschema:EBook
schema:contributor
schema:copyrightYear"2008"
schema:datePublished"2008"
schema:description"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 -- Facility location."
schema:exampleOfWork<http://worldcat.org/entity/work/id/792725138>
schema:inLanguage"en"
schema:name"Combinatorial optimization theory and algorithms"
schema:numberOfPages"627"
schema:publisher
schema:url<http://site.ebrary.com/id/10230464>
schema:url<http://www.myilibrary.com?id=135269>
schema:url<http://dx.doi.org/10.1007/978-3-540-71844-4>
schema:url<http://www.springerlink.com/content/978-3-540-71844-4>
schema:url<http://rave.ohiolink.edu/ebooks/ebc/9783540735564>
schema:url<http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-71843-7>
schema:workExample
schema:workExample
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.