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

DOI10.1007/S10878-007-9109-XzbMATH Open1180.90309OpenAlexW2070890709MaRDI QIDQ841604FDOQ841604

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

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

zbMATH Keywords

nonlinear programmingLagrangian relaxationcapacitated arc routingmonotropic and integer programming

Mathematics Subject Classification ID

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

Cites Work

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

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)