New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem

DOI10.1002/net.20469zbMath1231.90075MaRDI QIDQ3113511

Enrique Benavent, Angel Corberán, José María Sanchis, Isaac Plana

Publication date: 18 January 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20469

zbMATH Keywords

rural postman problem; facets; windy rural postman problem; windy postman problem; multivehicle

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

Related Items

A matheuristic for the team orienteering arc routing problem, A metaheuristic for the min-max windy rural postman problem with K vehicles, The periodic rural postman problem with irregular services on mixed graphs, The collaborative consistent vehicle routing problem with workload balance, Multi-depot rural postman problems, A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem

Cites Work

• Lower bounds and heuristics for the windy rural postman problem
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• Solvable cases of the \(k\)-person Chinese postman problem
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Min-Max K -vehicles windy rural postman problem
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• A branch & cut algorithm for the windy general routing problem and special cases
• A cutting plane algorithm for the general routing problem