Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem

DOI10.1287/moor.24.2.273zbMath0977.90040OpenAlexW2164922071MaRDI QIDQ2757595

Egon Balas, Matteo Fischetti

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5ae23e1cb2e3c05371d8c538b73960a60b419460

zbMATH Keywords

asymmetric traveling salesman problemfacet defining inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

An integer programming approach for the time-dependent TSP ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ New facets of the STS polytope generated from known facets of the ATS polytope ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs ⋮ The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem