scientific article; zbMATH DE number 556046

MaRDI QIDQ4288840zbMATH OpenFDO

Authors Christoph Arlt

Publication date 21 April 1994

zbMATH Keywords

branch-and-boundmin-cost network flowprimal algorithms

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 5173820
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• scientific article; zbMATH DE number 4174642
• A unified framework for primal-dual methods in minimum cost network flow problems
• Analysis of a flow problem with fixed charges

Cited in

(10)

• Solving to optimality the uncapacitated fixed-charge network flow problem
• On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
• A heuristic algorithm for a network problem with variable upper bounds
• Hierarchical solution of network flow problems
• Computational comparison of two solution procedures for allocation/processing networks
• Analysis of a flow problem with fixed charges
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• scientific article; zbMATH DE number 1927152 (Why is no real title available?)
• Network flow problems with pricing decisions
• Bilinear modeling solution approach for fixed charge network flow problems

This page was built for publication:

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