A Lagrangian relaxation approach to large-scale flow interception problems

DOI10.1016/J.EJOR.2008.08.024zbMath1163.90814OpenAlexW2087399459MaRDI QIDQ1026763

Fatma Gzara, Erhan Erkut

Publication date: 29 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.024

zbMATH Keywords

Lagrangian relaxationcutting planessubgradient optimizationdual heuristicflow interception problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A Lagrangian decomposition approach for the pump scheduling problem in water networks ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Distributions of rectilinear deviation distance to visit a facility

Cites Work

• Unnamed Item
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• On the choice of step size in subgradient optimization
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Optimal Location of Discretionary Service Facilities
• On convergence rates of subgradient optimization methods
• Ergodic convergence in subgradient optimization
• Validation of subgradient optimization
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds

This page was built for publication: A Lagrangian relaxation approach to large-scale flow interception problems