The arc partitioning problem
From MaRDI portal
Publication:806736
DOI10.1016/0377-2217(91)90072-4zbMath0729.90595OpenAlexW1964115152MaRDI QIDQ806736
Lawrence Bodin, Laurence S. Levy
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90072-4
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)
Related Items
Data-driven optimization and statistical modeling to improve meter reading for utility companies, A survey of models and algorithms for emergency response logistics in electric distribution systems. I: Reliability planning with fault considerations, A redistricting problem applied to meter reading in power distribution networks, Hybrid genetic algorithm for the open capacitated arc routing problem, Routing problems: A bibliography, Districting for Arc Routing, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, The open capacitated arc routing problem, A novel model for arc territory design: promoting Eulerian districts, Heuristic methods for the sectoring arc routing problem, A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel insert method for the capacitated arc routing problem
- An algorithm for the Rural Postman problem on a directed graph
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- Capacitated arc routing problems
- On the complexity of edge traversing
- On general routing problems: Comments
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
- Approximate solutions for the maximum benefit chinese postman problem
