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

DOI10.1016/S0377-2217(01)00110-2zbMATH Open1003.90004MaRDI QIDQ1600948FDOQ1600948

Authors: Bernard Gendron 

Publication date: 16 June 2002

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

Recommendations

• A dual ascent approach to the fixed-charge capacitated network design problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems

zbMATH Keywords

Lagrangean relaxationnetwork programmingdual-ascent proceduremulticommodity capacited fixed-charge network design

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
• A dual approach for solving the combined distribution and assignment problem with link capacity constraints
• Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Models and algorithms for network reduction
• Scatter search for network design problem
• Fixed charge multicommodity network design using \(p\)-partition facets

This page was built for publication: A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem

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