The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
From MaRDI portal
Publication:3629465
DOI10.1137/050640886zbMath1173.90508OpenAlexW2028775817MaRDI QIDQ3629465
Isaac Plana, José María Sanchis, Angel Corberán
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (18)
A branch & cut algorithm for the windy general routing problem and special cases ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Integer programming formulation and polyhedral results for windy collaborative arc routing problem ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ New results on the windy postman problem ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ Solution of real-world postman problems ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ Min-Max K -vehicles windy rural postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm ⋮ 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
This page was built for publication: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
