A cutting plane algorithm for the general routing problem
From MaRDI portal
Publication:5935711
DOI10.1007/s101070100219zbMath0989.90026MaRDI QIDQ5935711
José María Sanchis, Adam N. Letchford, Angel Corberán
Publication date: 7 August 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
cutting planesgeneral routing problemrural postman problemtravelling salesman problemvalid inequalities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (29)
The mixed capacitated general routing problem under uncertainty ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Integer programming formulation and polyhedral results for windy collaborative arc routing problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ The generalized arc routing problem ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ Improving a constructive heuristic for the general routing problem ⋮ A branch-and-price algorithm for the windy rural postman problem ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ On the general routing polytope ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ The Steiner traveling salesman problem and its extensions ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ On the distance-constrained close enough arc routing problem ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ Solving the close-enough arc routing problem ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem ⋮ New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem ⋮ Solving the prize-collecting rural postman problem ⋮ Heuristics for the rural postman problem
Uses Software
This page was built for publication: A cutting plane algorithm for the general routing problem
