A parameterized lower bounding method for the open capacitated arc routing problem
From MaRDI portal
Publication:6491347
DOI10.1016/J.EJCO.2023.100080MaRDI QIDQ6491347
Fábio Luiz Usberti, Rafael Kendy Arakaki
Publication date: 24 April 2024
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
lower boundsgeneral routing problemparameterizationlower boundingcapacitated arc routing problemrelaxed formulationdual boundsnetwork flow formulationcapacity inequalitiesmulti-vehicle arc routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The mixed capacitated arc routing problem with non-overlapping routes
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Modeling and solving the mixed capacitated general routing problem
- The open capacitated arc routing problem
- The arc partitioning problem
- Heuristics for a dynamic rural postman problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An improved heuristic for the capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Hybrid genetic algorithm for the open capacitated arc routing problem
- A cutting plane algorithm for the capacitated arc routing problem
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Exact approaches for the cutting path determination problem
- Profitable mixed capacitated arc routing and related problems
- Multi-Terminal Network Flows
- Capacitated arc routing problems
- Odd Minimum Cut-Sets and b-Matchings
- Arc Routing
This page was built for publication: A parameterized lower bounding method for the open capacitated arc routing problem