Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem

DOI10.1002/net.21765zbMath1394.90481OpenAlexW2750078990WikidataQ58169404 ScholiaQ58169404MaRDI QIDQ4584873

Daniel Santos, Mario Ruthmair, Pierre Pesneau, Luís Gouveia

Publication date: 4 September 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01655793/file/combining-projecting-flow.pdf

zbMATH Keywords

traveling salesmaninteger linear programmingvalid inequalitiesprecedence constraintsreformulationcutting plane algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Methods of successive quadratic programming type (90C55)

Related Items (4)

The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm

This page was built for publication: Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem