Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

DOI10.1016/j.disopt.2005.10.003zbMath1109.90067OpenAlexW1979105420MaRDI QIDQ2494811

Natashia Boland, Vicky Mak

Publication date: 30 June 2006

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.10.003

zbMATH Keywords

travelling salesmanpolyhedral combinatoricscombinatorial optimisation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches ⋮ Solving shortest path problems with a weight constraint and replenishment arcs

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyhedral study of the capacitated vehicle routing problem
• Clique tree inequalities define facets of the asymmetric traveling salesman polytope
• The aircraft rotation problem
• On the monotonization of polyhedra
• The asymmetric traveling salesman problem with replenishment arcs
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• Flight String Models for Aircraft Fleeting and Routing
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• Facets of the Asymmetric Traveling Salesman Polytope
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph

This page was built for publication: Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs