The windy rural postman problem with a time-dependent zigzag option
From MaRDI portal
Publication:1751757
DOI10.1016/j.ejor.2016.09.010zbMath1394.90491OpenAlexW2518785521MaRDI QIDQ1751757
Erwin Pesch, Rui Zhang, Jenny Nossack, Bruce L. Golden
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.010
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Arc routing problems: A review of the past, present, and future, The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands, Uncertain multi-objective Chinese postman problem
Uses Software
Cites Work
- Unnamed Item
- Arc routing problems with time-dependent service costs
- Undirected postman problems with zigzagging option: a cutting-plane approach
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- The rural postman problem with deadline classes
- Routeing winter gritting vehicles
- The traveling salesman problem and its variations
- Solution of real-world postman problems
- A constraint programming approach to the Chinese postman problem with time windows
- The Vehicle Routing Problem
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- The time-dependent rural postman problem: polyhedral results
- A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
- Vehicle Routing
- An algorithm for the Rural Postman problem on a directed graph
- Efficient Algorithms for Shortest Paths in Sparse Networks
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Arc Routing
- In Pursuit of the Traveling Salesman
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A Note on Postman Problems with Zigzag Service