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 planes; general routing problem; rural postman problem; travelling salesman problem; valid inequalities
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
90B20: Traffic problems in operations research
Related Items
On path-bridge inequalities for the orienteering arc routing problems, A branch-and-price algorithm for the windy rural postman problem, A new integer programming formulation of the graphical traveling salesman problem, A new integer programming formulation of the graphical traveling salesman problem, A note on computational aspects of the Steiner traveling salesman problem, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Improving a constructive heuristic for the general routing problem, Two-phase branch-and-cut for the mixed capacitated general routing problem, Pricing routines for vehicle routing with time windows on road networks, Modeling and solving the mixed capacitated general routing problem, A branch-and-cut algorithm for the maximum benefit Chinese postman problem, Lower bounds and heuristics for the windy rural postman problem, Solving the prize-collecting rural postman problem, Heuristics for the rural postman problem, The generalized arc routing problem, The periodic rural postman problem with irregular services on mixed graphs, The Steiner traveling salesman problem and its extensions, On the distance-constrained close enough arc routing problem, An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem, Integer programming formulation and polyhedral results for windy collaborative arc routing problem, Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem, On the general routing polytope, Computing finest mincut partitions of a graph and application to routing problems, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, The mixed capacitated general routing problem under uncertainty, Vehicle routing on road networks: how good is Euclidean approximation?, Solving the close-enough arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
Uses Software
