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
. There are further possibilities for solving the LOP exactly, e.g. by formulating it as
, but these approaches did not lead to the implementation of practical algorithms and we will not elaborate on them here.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten