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

DOI10.1002/net.20469zbMath1231.90075OpenAlexW2014159196MaRDI 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 problemfacetswindy rural postman problemwindy postman problemmultivehicle

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (7)

A matheuristic for the team orienteering arc routing problem ⋮ Multi-depot rural postman problems ⋮ A multiperiod drayage problem with customer-dependent service periods ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ 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

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

This page was built for publication: New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem