A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

@article{Jozefowiez2012AGB,
  title={A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem},
  author={Nicolas Jozefowiez and Gilbert Laporte and Fr{\'e}d{\'e}ric Semet},
  journal={INFORMS Journal on Computing},
  year={2012},
  volume={24},
  pages={554-564}
}
This paper describes a generic branch-and-cut algorithm applicable to the solution of multiobjective optimization problems for which a lower bound can be defined as a polynomially solvable multiobjective problem. The algorithm closely follows standard branch and cut except for the definition of the lower and upper bounds and some optional speed-up mechanisms. It is applied to a routing problem called the multilabel traveling salesman problem, a variant of the traveling salesman problem in which… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

A hybrid approach for biobjective optimization

  • Discrete Optimization
  • 2018
VIEW 1 EXCERPT
CITES METHODS