The budgeted minimum cost flow problem with unit upgrading cost

DOI10.1002/NET.21724zbMATH Open1390.90096OpenAlexW2556305864MaRDI QIDQ4565772FDOQ4565772

Authors: Christina Büsing, Arie M. C. A. Koster, Sarah Kirchner, Annika Thome 

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21724

Recommendations

• scientific article; zbMATH DE number 1859293
• Optimizing cost flows by edge cost and capacity upgrade
• On the complexity and approximability of budget-constrained minimum cost flows
• scientific article; zbMATH DE number 1696527
• A network simplex method for the budget-constrained minimum cost flow problem

zbMATH Keywords

complexityminimum cost flownetwork optimizationbudgeted optimizationseries-parallel graphsgraphs of bounded treewidthbilinear problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Cited In (7)

• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• Budget-constrained minimum cost flows
• Budgeted colored matching problems
• Improving post-disaster road network accessibility by strengthening links against failures
• On the complexity and approximability of budget-constrained minimum cost flows
• The capacitated budgeted minimum cost flow problem with unit upgrading costs
• On the complexity of the upgrading version of the maximal covering location problem

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

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