A branch-and-price algorithm for the windy rural postman problem

DOI10.1051/RO/2012004MaRDI QIDQ5388154zbMATH OpenOpenAlexFDO

Authors H. Murat Afsar, Nicolas Jozefowiez, Pierre Lopez

Publication date 18 April 2012

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222504

zbMATH Keywords

branch-and-pricewindy rural postman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10)

Recommendations

• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
• Lower bounds and heuristics for the windy rural postman problem
• New heuristic algorithms for the windy rural postman problem
• Algorithms for the windy postman problem

Cites work

• A branch-and-cut algorithm for the undirected rural postman problem
• A cutting plane algorithm for the general routing problem
• A cutting plane algorithm for the windy postman problem
• A fundamental problem in vehicle routing
• A polyhedral approach to the rural postman problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• An algorithm for the Rural Postman problem on a directed graph
• Decomposition Principle for Linear Programs
• Improvement Procedures for the Undirected Rural Postman Problem
• Lower bounds and heuristics for the windy rural postman problem
• New heuristic algorithms for the windy rural postman problem
• On general routing problems
• On the windy postman problem on Eulerian graphs
• The Chinese Postman Problem for Mixed Networks

Cited in

(9)

• A branch-and-bound algorithm for the time-dependent rural postman problem
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• The windy rural postman problem with a time-dependent zigzag option
• New heuristic algorithms for the windy rural postman problem
• A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the windy profitable location rural postman problem
• A metaheuristic for the min-max windy rural postman problem with K vehicles

This page was built for publication: A branch-and-price algorithm for the windy rural postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388154)