Advertisement
Published in:
2011 | OriginalPaper | Chapter
Branch-and-Bound
Authors : Prof. Dr. Rafael Martí, Prof. Dr. Gerhard Reinelt
Published in: The Linear Ordering Problem
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.