Abstract
An in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Cite
CITATION STYLE
Korte, B., Schrader, R., & Lovász, L. (1991). Greedoids. Media (Vol. 4, p. 847). Springer Berlin Heidelberg. Retrieved from http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Algorithms+and+Combinatorics+24#9 http://link.springer.com/10.1007/978-3-642-24508-4 http://link.springer.com/10.1007/978-3-642-58191-5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
