Advertisement

A Specific Branch-and-Bound Method

  • Patricia Domínguez-Marín
Part of the Combinatorial Optimization book series (COOP, volume 15)

Abstract

In the last chapter we proposed different linearisations for the DOMP which resulted in tight formulations models. Due to the huge computing time and memory requirements when these models are used for solving the DOMP with a standard mathematical programming software (in our case, ILOG CPLEX 6.6), see Appendix B.2, large instances could not be solved. Thus, in this chapter, we derive a specific branch-and-bound (B&B) algorithm which takes advantage of the structure of the problem, see Boland et al. [6]. Exhaustive information about the branching and the bounding schemes is presented. Finally, computational results are reported to show the effectiveness of the B&B method, and a statistical analysis is presented to compare the behaviour of its performance on different types of problems (depending on the A vector).

Keywords

Computing Time Feasible Solution Leaf Node Child Node Variable Neighbourhood Search 
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 Science+Business Media New York 2003

Authors and Affiliations

  • Patricia Domínguez-Marín

There are no affiliations available

Personalised recommendations