An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
From MaRDI portal
Publication:841604
DOI10.1007/s10878-007-9109-xzbMath1180.90309OpenAlexW2070890709MaRDI QIDQ841604
Reza Tavakkoli-Moghaddam, Saman Eskandarzadeh, Amir Azaron
Publication date: 18 September 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9109-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Vehicle routing with split deliveries
- Routing helicopters for crew exchanges on off-shore locations
- A cutting plane algorithm for the capacitated arc routing problem
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Split delivery routing
- A unified framework for primal-dual methods in minimum cost network flow problems
- Relaxation Methods for Linear Programs
- Savings by Split Delivery Routing
- Split-delivery routeing heuristics in livestock feed distribution
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Convex Analysis
This page was built for publication: An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems