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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Christina BÃ¼sing, Arie M. C. A. Koster, Sarah Kirchner, Annika Thome
- Networks
- 2017

The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem byâ€¦Â (More)

Is this relevant?

2014

2014

- Sibo Ding
- Soft Comput.
- 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)

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

- Ã‡igdem GÃ¼ler, Horst W. Hamacher
- J. Comb. Optim.
- 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)

Is this relevant?

2005

2005

- Antonio SedeÃ±o-Noda, Carlos GonzÃ¡lez-MartÃn, Jose GutiÃ©rrez
- European Journal of Operational Research
- 2005

We address the two-commodity minimum cost flow problem considering two objectives. We show that the biobjective undirected twoâ€¦Â (More)

Is this relevant?

2001

2001

- Patrizia Beraldi, Francesca Guerriero, Roberto Musmanno
- Comp. Opt. and Appl.
- 2001

In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallelâ€¦Â (More)

Is this relevant?

1993

1993

- Dimitri P. Bertsekas, David A. CastaÃ±Ã³n
- Comp. Opt. and Appl.
- 1993

In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linearâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Andrew V. Goldberg
- IPCO
- 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

- James B. Orlin
- 1988

In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement ofâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Andrew V. Goldberg, Robert E. Tarjan
- STOC
- 1987

We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amountâ€¦Â (More)

Is this relevant?