Accelerating the convergence of subgradient optimisation

DOI10.1016/S0377-2217(98)00194-5zbMath0998.90056MaRDI QIDQ1847153

Barrie M. Baker, Janice Sheasby

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingLagrangean relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Methods of reduced gradient type (90C52)

Related Items

On some difficult linear programs coming from set partitioning, Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization, A Lagrangian approach for minimum cost single round robin tournaments, An effective line search for the subgradient method, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Uses Software

• OR-Library
• VRP

Cites Work

• Extensions to the generalised assignment heuristic for vehicle routing
• An Improved Algorithm for the Capacitated Facility Location Problem
• Validation of subgradient optimization
• Minimization of unsmooth functionals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item