1988 | OriginalPaper | Buchkapitel
Combinatorial Optimization: A Tour d’Horizon
verfasst von : Martin Grötschel, László Lovász, Alexander Schrijver
Erschienen in: Geometric Algorithms and Combinatorial Optimization
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.