Abstract
We now turn to the discussion of how to solve the linear ordering problem to (proven) optimality. In this chapter we start with the branch-and-bound method which is a general procedure for solving combinatorial optimization problems. In the subsequent chapters this approach will be realized in a special way leading to the so-called branch-and-cut method. There are further possibilities for solving the LOP exactly, e.g. by formulating it as dynamic program or as quadratic assignment problem, but these approaches did not lead to the implementation of practical algorithms and we will not elaborate on them here.
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-Bound. In: The Linear Ordering Problem. Applied Mathematical Sciences, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16729-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-16729-4_4
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)