Skip to search formSkip to main contentSkip to account menu

Minimum-cost flow problem

Known as: Minimum cost flow problem, Min cost flow, Minimum cost maximum flow problem 
The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Efficient hosting of applications in a globally distributed multi-tenant cloud computing platform requires policies to decide… 
2011
2011
Incremental algorithms may save computational time to solve different network flow problems. Let us consider a network in which… 
2009
2009
In this paper, we describe and solve the problem of establishing a minimum cost flow in networks with node capacities. We show… 
2009
2009
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and many-core… 
2007
2007
Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in… 
2007
2007
The author study the minimum cost flow problem with not only fixed cost but also variable cost,and they found it be a mixed 0-1… 
2005
2005
In this thesis, we consider three special minimum cost flow problems in a distri- bution network, a kind of manufacturing network… 
2004
2004
Sensor networks consist of a large number of sensor nodes performing distributed sensing and event detection. As sensor nodes are… 
1992
1992
Directed hypergraphs have been introduced quite recently in connection with different application areas, such as propositional… 
1990
1990
In this paper we discuss the parallel asynchronous implementation of the classical primal-dual method for solving the linear…