New inequalities for the general routing problem

DOI10.1016/S0377-2217(96)00346-3zbMath0924.90127OpenAlexW1969274712WikidataQ57702403 ScholiaQ57702403MaRDI QIDQ1278493

Adam N. Letchford

Publication date: 22 February 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)00346-3

zbMATH Keywords

general routing problemrural postman problemvalid inequalitiesseparation algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (15)

Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Integer programming formulation and polyhedral results for windy collaborative arc routing problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ A branch-and-cut algorithm for the orienteering arc routing problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ A heuristic algorithm based on Monte Carlo methods for the rural postman problem. ⋮ On the general routing polytope ⋮ The Steiner traveling salesman problem and its extensions ⋮ A note on the undirected rural postman problem polytope ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ A constructive heuristic for the undirected rural postman problem ⋮ On the distance-constrained close enough arc routing problem ⋮ The general routing polyhedron: A unifying framework ⋮ The rural postman problem with deadline classes ⋮ The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

Cites Work

• Unnamed Item
• Facet identification for the symmetric traveling salesman polytope
• A cutting plane procedure for the travelling salesman problem on road networks
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• A polyhedral approach to the rural postman problem
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• The traveling salesman problem on a graph and some related integer polyhedra
• Odd Minimum Cut-Sets and b-Matchings
• 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: New inequalities for the general routing problem