The general routing polyhedron: A unifying framework
From MaRDI portal
(Redirected from Publication:1806888)
Recommendations
- On the general routing polytope
- The mixed general routing polyhedron
- scientific article; zbMATH DE number 5021774
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- Routing in polygonal domains
- Routing in polygonal domains
- Generalized network design polyhedra
- The generalized packet routing problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Dynamic Routing Schemes for General Graphs
Cites work
- scientific article; zbMATH DE number 16722 (Why is no real title available?)
- scientific article; zbMATH DE number 1342122 (Why is no real title available?)
- 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
- Arc Routing Problems, Part II: The Rural Postman Problem
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Matching, Euler tours and the Chinese postman
- Maximum matching and a polyhedron with 0,1-vertices
- New inequalities for the general routing problem
- On general routing problems
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem: A computational study
- Separating maximally violated comb inequalities in planar graphs
- Small Travelling Salesman Polytopes
- The Binested Inequalities for the Symmetric Traveling Salesman Polytope
- 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
(13)- Routing in polygonal domains
- The Steiner traveling salesman problem and its extensions
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- scientific article; zbMATH DE number 5021774 (Why is no real title available?)
- The generalized packet routing problem
- Exact solution of the generalized routing problem through graph transformations
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Modeling and solving the mixed capacitated general routing problem
- Computing finest mincut partitions of a graph and application to routing problems
- Lower bounds and heuristics for the windy rural postman problem
- Transformation of Facets of the General Routing Problem Polytope
- On the general routing polytope
- Generalized network design polyhedra
This page was built for publication: The general routing polyhedron: A unifying framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806888)
