The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
DOI10.1016/S0377-2217(96)00337-2zbMATH Open0951.90009OpenAlexW1966183413MaRDI QIDQ1296789FDOQ1296789
José M. Sanchis, Ángel Corberán
Publication date: 14 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00337-2
routinggeneral routing problemrural postman problemfacets of polyhedragraphical traveling salesman problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A cutting plane procedure for the travelling salesman problem on road networks
- The traveling salesman problem on a graph and some related integer polyhedra
- A fundamental problem in vehicle routing
- A capacitated general routing problem on mixed networks
- An algorithm for the Rural Postman problem on a directed graph
- On general routing problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- New inequalities for the general routing problem
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- A new class of cutting planes for the symmetric travelling salesman problem
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
Cited In (19)
- The Steiner traveling salesman problem and its extensions
- An approximation algorithm for the general routing problem
- Multi-depot rural postman problems
- Title not available (Why is that?)
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Modeling and solving the mixed capacitated general routing problem
- Modeling and Solving the Intersection Inspection Rural Postman Problem
- Solving the prize-collecting rural postman problem
- The rural postman problem with deadline classes
- Computing finest mincut partitions of a graph and application to routing problems
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
- New inequalities for the general routing problem
- Routing problems: A bibliography
- Heuristics for a dynamic rural postman problem
- The general routing polyhedron: A unifying framework
- Undirected postman problems with zigzagging option: a cutting-plane approach
- Lower bounds and heuristics for the windy rural postman problem
- On the general routing polytope
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
This page was built for publication: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296789)