Article ID Journal Published Year Pages File Type
5777227 Electronic Notes in Discrete Mathematics 2016 4 Pages PDF
Abstract
We consider a constraint minimum cost flow problem and show that it is in general NP-complete. For special graph classes we give (pseudo-)polynomial algorithms.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs
Authors
, , ,