Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective

DOI10.1007/978-3-030-68520-1_1zbMath1476.90287OpenAlexW3130098285MaRDI QIDQ5011674

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

metaheuristicsMIPbalanced TSP

Mathematics Subject Classification ID

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

Related Items (1)

balancedTSPCode

Cites Work

• Local branching

This page was built for publication: Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective