Approximate solutions of capacitated fixed-charge minimum cost network flow problems

DOI10.1002/net.3230210606zbMath0773.90027OpenAlexW2032027865MaRDI QIDQ3984287

Okitsugu Fujiwara, Do Ba Khang

Publication date: 27 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210606

zbMATH Keywords

heuristicminimum spanning treecapacitated, single-commodity fixed-charge network flowlower bounding algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A generalized bi-criteria fuzzy integer flow sharing problem ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Adaptive dynamic cost updating procedure for solving fixed charge network flow problems ⋮ Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation ⋮ A dual ascent approach to the fixed-charge capacitated network design problem ⋮ Mathematical models for selection of optimal place and size of connections considering the time-value of money ⋮ An algorithm for a concave production cost network flow problem ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate solutions of capacitated fixed-charge minimum cost network flow problems