The capacitated budgeted minimum cost flow problem with unit upgrading costs

DOI10.1016/J.ENDM.2016.10.034MaRDI QIDQ510969zbMATH OpenOpenAlexFDO

Authors Christina Büsing, Sarah Kirchner, Annika Thome

Publication date 14 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.10.034

zbMATH Keywords

complexityminimum cost flowpolynomial algorithmpseudo-polynomial algorithm

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The accessibility arc upgrading problem
• The budgeted minimum cost flow problem with unit upgrading cost
• When the Greedy Solution Solves a Class of Knapsack Problems

This page was built for publication: The capacitated budgeted minimum cost flow problem with unit upgrading costs

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