Finding all optimal solutions to the network flow problem

DOI10.1007/BFB0121096MaRDI QIDQ3714876zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121096

zbMATH Keywords

alternative solutionsfeasible optimum basic solutionminimum cost network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Linear programming (90C05)

Recommendations

• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• scientific article; zbMATH DE number 5997367
• scientific article; zbMATH DE number 5173820
• scientific article; zbMATH DE number 4068646
• Efficient solutions for the bicriteria network flow problem

Cited in

(4)

• Efficient solutions for the bicriteria network flow problem
• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• scientific article; zbMATH DE number 4068646 (Why is no real title available?)
• The problem of minimum cost flow in undirected networks: optimality conditions and analysis of alternative formulations

This page was built for publication: Finding all optimal solutions to the network flow problem

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