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

DOI10.1016/S0377-2217(96)00337-2MaRDI QIDQ1296789zbMATH OpenOpenAlexFDO

Authors Ángel Corberán, José M. Sanchis

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

routinggeneral routing problemrural postman problemfacets 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)

Recommendations

• On the general routing polytope
• The general routing polyhedron: A unifying framework
• Transformation of Facets of the General Routing Problem Polytope
• scientific article; zbMATH DE number 5021774

Cites work

• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• A capacitated general routing problem on mixed networks
• A cutting plane procedure for the travelling salesman problem on road networks
• A fundamental problem in vehicle routing
• A new class of cutting planes for the symmetric travelling salesman problem
• A polyhedral approach to the rural postman problem
• An algorithm for the Rural Postman problem on a directed graph
• Arc Routing Problems, Part II: The Rural Postman Problem
• New inequalities for the general routing problem
• On general routing problems
• The capacitated arc routing problem: Valid inequalities and facets
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
• The traveling salesman problem on a graph and some related integer polyhedra

Cited in

(22)

• The Steiner traveling salesman problem and its extensions
• An approximation algorithm for the general routing problem
• Multi-depot rural postman problems
• scientific article; zbMATH DE number 5021774 (Why is no real title available?)
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• Modeling and solving the mixed capacitated general routing problem
• New Results on the Mixed General Routing Problem
• Solving the prize-collecting rural postman problem
• Modeling and Solving the Intersection Inspection 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
• Improving a constructive heuristic for the general routing 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
• Transformation of Facets of the General Routing Problem Polytope
• 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)