An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems

DOI10.1007/S10878-007-9109-XMaRDI QIDQ841604zbMATH OpenOpenAlexFDO

Authors Saman Eskandarzadeh, R. Tavakkoli-Moghaddam, 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

zbMATH Keywords

nonlinear programmingLagrangian relaxationcapacitated arc routingmonotropic and integer programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Recommendations

• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• An exact algorithm for the capacitated arc routing problem with deadheading demand
• Exploiting sparsity in pricing routines for the capacitated arc routing problem

Cites work

• scientific article; zbMATH DE number 3853853 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 279304 (Why is no real title available?)
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A cutting plane algorithm for the capacitated arc routing problem
• A unified framework for primal-dual methods in minimum cost network flow problems
• Branch-and-price: Column generation for solving huge integer programs
• Competitive memetic algorithms for arc routing problems
• Convex Analysis
• Lower and upper bounds for the mixed capacitated arc routing problem
• Relaxation Methods for Linear Programs
• Routing helicopters for crew exchanges on off-shore locations
• Savings by Split Delivery Routing
• Solving capacitated arc routing problems using a transformation to the CVRP
• Split delivery routing
• Split-delivery routeing heuristics in livestock feed distribution
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Vehicle routing with split deliveries

This page was built for publication: An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841604)