The general routing polyhedron: A unifying framework
From MaRDI portal
Publication:1806888
DOI10.1016/S0377-2217(97)00377-9zbMath0937.90008WikidataQ57702396 ScholiaQ57702396MaRDI QIDQ1806888
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ 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 ⋮ The common face of some 0/1-polytopes with NP-complete nonadjacency relation
Cites Work
- Unnamed Item
- 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 graphical relaxation: A new framework for the symmetric traveling salesman polytope
- Separating Maximally Violated Comb Inequalities in Planar Graphs
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- On the symmetric travelling salesman problem I: Inequalities
- The traveling salesman problem on a graph and some related integer polyhedra
- On the symmetric travelling salesman problem: A computational study
- Small Travelling Salesman Polytopes
- The Binested Inequalities for the Symmetric Traveling Salesman Polytope
- On general routing problems
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part II: The Rural Postman Problem
- Maximum matching and a polyhedron with 0,1-vertices
