Advertisement

Branch-and-Bound

  • Rafael Martí
  • Gerhard Reinelt
Chapter
Part of the Applied Mathematical Sciences book series (AMS, volume 175)

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.

Keywords

Feasible Solution Combinatorial Optimization Problem Lagrangian Relaxation Quadratic Assignment Problem Bundle Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Dpto Estadística e Inv. OperativaUniversitat de ValènciaValenciaSpain
  2. 2.Inst. InformatikUniversität HeidelbergHeidelbergGermany

Personalised recommendations