Abstract
In the remaining part of this book we apply the methods developed in the first part to combinatorial optimization. In this chapter we give some illuminating examples to explain the basic techniques of deriving polynomial time algorithms for combinatorial optimization problems. These techniques are based on combining the ellipsoid method and basis reduction with results from the field called “polyhedral combinatorics”, where combinatorial optimization problems are formulated as linear programs. Chapter 8 contains a comprehensive survey of combinatorial problems to which these methods apply. Finally, in the last two chapters we discuss some more advanced examples in greater detail.
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: Some Basic Examples. In: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97881-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-97881-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97883-8
Online ISBN: 978-3-642-97881-4
eBook Packages: Springer Book Archive