A cutting plane algorithm for the general routing problem
From MaRDI portal
Recommendations
- A cutting plane algorithm for the capacitated arc routing problem
- scientific article; zbMATH DE number 2134197
- A cutting plane procedure for the travelling salesman problem on road networks
- scientific article; zbMATH DE number 1263288
- Routing in grid graphs by cutting planes
- A simple algorithm for the planar multiway cut problem
- An approximation algorithm for the general routing problem
- Algorithms for 2-Route Cut Problems
- A cutting plane algorithm for the capacitated facility location problem
- A cutting plane algorithm for the capacitated connected facility location problem
Cited in
(38)- Solving the prize-collecting rural postman problem
- Heuristics for the rural postman problem
- An approximation algorithm for the general routing 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
- scientific article; zbMATH DE number 432991 (Why is no real title available?)
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Pricing routines for vehicle routing with time windows on road networks
- A cutting plane approach to solve the railway traveling salesman problem
- Algorithms for 2-Route Cut Problems
- Modeling and solving the mixed capacitated general routing problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Exact solution of the generalized routing problem through graph transformations
- On path-bridge inequalities for the orienteering arc routing problems
- A branch & cut algorithm for the windy general routing problem and special cases
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- 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
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
- PTAS for Euclidean travelling salesman problem with soft time windows
- Lower bounds and heuristics for the windy rural postman problem
This page was built for publication: A cutting plane algorithm for the general routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935711)
