The asymmetric traveling salesman problem with replenishment arcs

DOI10.1016/S0377-2217(99)00266-0zbMath1054.90058OpenAlexW1980220620MaRDI QIDQ1569947

Natashia Boland, Nemhauser, George I., Lloyd W. Clarke

Publication date: 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00266-0

zbMATH Keywords

Traveling salesmanColumn generationCut generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27)

Related Items

Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem, 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, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs, The Aircraft Maintenance Routing Problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach for crew pairing problems by column generation with an application to air transportation
• An analytical comparison of different formulations of the travelling salesman problem
• Solving binary cutting stock problems by column generation and branch- and-bound
• MINTO, a Mixed INTeger Optimizer
• The aircraft rotation problem
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Flight String Models for Aircraft Fleeting and Routing
• Algorithms for finding paths with multiple constraints
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Maximum matching and a polyhedron with 0,1-vertices