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

DOI10.1016/0377-2217(95)00305-3zbMath0943.90501OpenAlexW1984344073MaRDI QIDQ1278408

Jeffrey W. Herrmann, Jean Marie Proth, George Ioannou, Ioannis Minis

Publication date: 22 February 1999

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

Full work available at URL: http://hdl.handle.net/1903/5508

zbMATH Keywords

heuristicsmanufacturingnetwork programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items

A capacity scaling heuristic for the multicommodity capacitated network design problem, Models and algorithms for network reduction, Discrete equal-capacityp-median problem, Fixed charge multicommodity network design using \(p\)-partition facets, Optimal design of capacitated production networks, Mathematical models for selection of optimal place and size of connections considering the time-value of money, A meta-heuristic approach for solving the urban network design problem, Benders-and-cut algorithm for fixed-charge capacitated network design problem, Memetic algorithms, A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem, Scatter search for network design problem

Cites Work

• Flow network design for manufacturing systems layout
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• The complexity of the network design problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design