Abstract
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.
This is a preview of subscription content, log in via an institution to check access.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Martí, R., Reinelt, G. (2011). Branch-and-Cut. In: The Linear Ordering Problem. Applied Mathematical Sciences, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16729-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-16729-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16728-7
Online ISBN: 978-3-642-16729-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)