A branch-and-price algorithm for the windy rural postman problem
From MaRDI portal
Publication:5388154
DOI10.1051/ro/2012004zbMath1235.90020OpenAlexW2033108906MaRDI QIDQ5388154
Pierre Lopez, Nicolas Jozefowiez, H. Murat Afsar
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
Cites Work
- Lower bounds and heuristics for the windy rural postman problem
- On the windy postman problem on Eulerian graphs
- A cutting plane algorithm for the windy postman problem
- A polyhedral approach to the rural postman problem
- A branch-and-cut algorithm for the undirected rural postman problem
- New heuristic algorithms for the windy rural postman problem
- Decomposition Principle for Linear Programs
- An algorithm for the Rural Postman problem on a directed graph
- The Chinese Postman Problem for Mixed Networks
- On general routing problems
- A fundamental problem in vehicle routing
- Improvement Procedures for the Undirected Rural Postman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A cutting plane algorithm for the general routing problem
This page was built for publication: A branch-and-price algorithm for the windy rural postman problem