A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem

DOI10.1016/S0377-2217(01)00110-2zbMath1003.90004MaRDI QIDQ1600948

Bernard Gendron

Publication date: 16 June 2002

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

zbMATH Keywords

network programmingLagrangean relaxationdual-ascent proceduremulticommodity capacited fixed-charge network design

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Related Items

Models and algorithms for network reduction, Fixed charge multicommodity network design using \(p\)-partition facets, Scatter search for network design problem

Cites Work

• A dual ascent approach to the fixed-charge capacitated network design problem
• A direct dual method for the mixed plant location problem with some side constraints
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Unnamed Item