An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits

By Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin. European Journal of Operational Research, 2009

344 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/72178be17d167cb684c4e530e35ae4aec19cc14e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

1. Pieter Vansteenwegen
2. Dirk Van Oudheusden
3. Wouter Souffriau

In Industrial and Manufacturing Engineering

1. Damianos Gavalas
2. Grammati E. Pantziou
3. Charalampos Konstantopoulos
4. Konstantinos Mastakas
5. Pieter Vansteenwegen
6. Dirk Van Oudheusden
7. Wouter Souffriau

Citations in the corpus

• A survey on algorithmic approaches for solving tourist trip design problems (2014, methodology): “In Bérubé et al. (2009) the first exact Pareto fronts (sets of non-dominated solutions) have been given for TSPP instances obtained from classical TSP instances, available in the TSPLIB Reinelt (1991).”
• The orienteering problem: A survey (2011, background): “The OP can be formulated as a TSP With Profits (TSPWP) (Feillet et al., 2005a; Bérubé et al., 2009) or as a special case of the Resource Constrained TSP (RCTSP) (Pekny and Miller, 1990).”