The capacitated budgeted minimum cost flow problem with unit upgrading costs

DOI10.1016/J.ENDM.2016.10.034zbMath1356.05145OpenAlexW2550748137MaRDI QIDQ510969

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

complexitypolynomial algorithmminimum cost flowpseudo-polynomial algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The accessibility arc upgrading problem
• When the Greedy Solution Solves a Class of Knapsack Problems
• The budgeted minimum cost flow problem with unit upgrading cost

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