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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
0204019722018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
The aimof this paper is to give an uncertainty distribution of the least cost of shipment of a commodity through a network with… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 1
  • table 2
Is this relevant?
2013
2013
  • M. Tlas
  • 2013
An efficient polynomial time algorithm for solving minimum cost flow problems has been proposed in this paper. This algorithm is… (More)
Is this relevant?
2010
2010
Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2005
2005
We address the two-commodity minimum cost flow problem considering two objectives. We show that the biobjective undirected two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2001
2001
In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1993
1993
In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linear… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The scaling push-relabel method is an important theoretical development in the area of minimum-cost ow algorithms. We study… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amount… (More)
  • table 1
Is this relevant?