Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective

DOI10.1007/978-3-030-68520-1_1MaRDI QIDQ5011674zbMATH OpenOpenAlexFDO

Authors Luc Libralesso

Publication date 27 August 2021

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-68520-1_1

zbMATH Keywords

balanced TSPmetaheuristicsMIP

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The balanced traveling salesman problem
• Metaheuristics for combinatorial optimization. Selected papers based on the presentations at the first international metaheuristics summer school, MESS 2018, Acireale-Sicily, Italy, July 21--25, 2018
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
• Exact algorithms for the equitable traveling salesman problem
• A bilevel programming approach to the travelling salesman problem.

Cites work

• Local branching

Cited in

(2)

• balancedTSPCode
• A branch-and-cut algorithm for the balanced traveling salesman problem

This page was built for publication: Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011674)