Abstract
In Chapter 7 we have introduced several basic combinatorial optimization problems, and we have shown in detail how the ellipsoid method and basis reduction together with polyhedral information about these problems can be used to design polynomial time algorithms. In this chapter we give an overview about combinatorial optimization problems that are solvable in polynomial time. We also survey important theorems that provide polyhedral descriptions of the polytopes associated with these problems. We indicate how these results can be employed to derive polynomial time algorithms based on the ellipsoid method and basis reduction. The results of this chapter are presented in a condensed form, to cover as much material as possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grötschel, M., Lovász, L., Schrijver, A. (1988). Combinatorial Optimization: A Tour d’Horizon. In: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97881-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-97881-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97883-8
Online ISBN: 978-3-642-97881-4
eBook Packages: Springer Book Archive