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

DOI10.1002/NET.3230210606MaRDI QIDQ3984287zbMATH OpenOpenAlexFDO

Authors Do Ba Khang, Okitsugu Fujiwara

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

capacitated, single-commodity fixed-charge network flowheuristiclower bounding algorithmminimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A multicommodity network flow application for the capacitated minimal spanning tree problem
• scientific article; zbMATH DE number 556046
• scientific article; zbMATH DE number 4147878

Cites work

• scientific article; zbMATH DE number 3900467 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(25)

• Mathematical models for selection of optimal place and size of connections considering the time-value of money
• A dual ascent approach to the fixed-charge capacitated network design problem
• An algorithm for a concave production cost network flow problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
• 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
• Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• COLE: a new heuristic approach for fixed charge problem computational results
• A heuristic algorithm for a network problem with variable upper bounds
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• scientific article; zbMATH DE number 4147878 (Why is no real title available?)
• scientific article; zbMATH DE number 4070604 (Why is no real title available?)
• Analysis of a flow problem with fixed charges
• scientific article; zbMATH DE number 556046 (Why is no real title available?)
• A generalized bi-criteria fuzzy integer flow sharing problem
• Minimum cost flow in a network with an overestimated arc capacity
• Network flow optimization with minimum quantities
• Minimum‐cost flow problems having arc‐activation costs
• Minimal-cost network flow problems with variable lower bounds on arc flows

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

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