Finding all optimal solutions to the network flow problem

DOI10.1007/BFb0121096zbMath0587.90042OpenAlexW17113973MaRDI QIDQ3714876

No author found.

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 solutionsminimum cost network flowfeasible optimum basic solution

Mathematics Subject Classification ID

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

Related Items (1)

Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem

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