The attractive traveling salesman problem

DOI10.1016/j.ejor.2009.06.029zbMath1176.90603MaRDI QIDQ1043335

Gilbert Laporte, Güneş Erdoğan, Jean-François Cordeau

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.029

zbMATH Keywords

linearization; tabu search; traveling salesman problem; branch-and-cut; demand allocation; demand attraction

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• TSPLIB