The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
DOI10.1137/050640886zbMATH Open1173.90508OpenAlexW2028775817MaRDI QIDQ3629465FDOQ3629465
Authors: Ángel Corberán, Isaac Plana, José M. Sanchis 
Publication date: 27 May 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050640886
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cited In (21)
- Solution of real-world postman problems
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- Search games on a network with travelling and search costs
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- Integer programming formulation and polyhedral results for windy collaborative arc routing problem
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A branch & cut algorithm for the windy general routing problem and special cases
- Modeling and solving the mixed capacitated general routing problem
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- A branch-and-cut algorithm for the profitable windy rural postman problem
- On path-bridge inequalities for the orienteering arc routing problems
- Recent results on arc routing problems: an annotated bibliography
- The mixed general routing polyhedron
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- The general routing polyhedron: A unifying framework
- Min-Max \(K\)-vehicles windy rural postman problem
- New results on the windy postman problem
This page was built for publication: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629465)
