A branch & cut algorithm for the windy general routing problem and special cases
From MaRDI portal
Publication:5295483
DOI10.1002/net.20176zbMath1141.90563OpenAlexW4249748964MaRDI QIDQ5295483
Angel Corberán, José María Sanchis, Isaac Plana
Publication date: 30 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20176
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (24)
Solving the median problem with continuous demand on a network ⋮ 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 ⋮ \(p\)-facility Huff location problem on networks ⋮ A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows ⋮ Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm ⋮ Plowing with precedence in polynomial time ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ Improving a constructive heuristic for the general routing problem ⋮ The multi‐purpose K‐drones general routing problem ⋮ New results on the windy postman problem ⋮ Single-facility huff location problems on networks ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ A matheuristic for the distance-constrained close-enough arc routing problem ⋮ 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 ⋮ Solving the length constrained \(K\)-drones rural postman problem ⋮ New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem ⋮ Solving the prize-collecting rural postman problem
Cites Work
This page was built for publication: A branch & cut algorithm for the windy general routing problem and special cases
