The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

DOI10.1016/S0377-2217(96)00337-2zbMath0951.90009OpenAlexW1966183413MaRDI QIDQ1296789

José María Sanchis, Angel 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

zbMATH Keywords

general routing problemrural postman problemroutingfacets of polyhedragraphical traveling salesman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (15)

Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ Routing problems: A bibliography ⋮ Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Modeling and Solving the Intersection Inspection Rural Postman Problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ Multi-depot rural postman problems ⋮ Heuristics for a dynamic rural postman problem ⋮ Undirected postman problems with zigzagging option: a cutting-plane approach ⋮ 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 ⋮ New inequalities for the general routing problem ⋮ Solving the prize-collecting rural postman problem ⋮ The rural postman problem with deadline classes

Cites Work

• Unnamed Item
• A cutting plane procedure for the travelling salesman problem on road networks
• 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
• 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 capacitated general routing problem on mixed networks
• The traveling salesman problem on a graph and some related integer polyhedra
• An algorithm for the Rural Postman problem on a directed graph
• On general routing problems
• A fundamental problem in vehicle routing
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra