Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2006

Highly Cited

2006

In this paper, an extension of the minimum cost flow (MCF) algorithm dealing with a sparse data grid, which allows the unwrapping… Expand

Is this relevant?

2001

2001

Abstract In this paper, we study a minimum cost flow problem on a time-varying network. Let N ( V , A , l , b , c r , c w ) be a… Expand

Is this relevant?

1999

1999

Both multiple objectives and multiple hierarchies minimum cost flow problems with fuzzy costs and fuzzy capacities in the arcs… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of… Expand

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 flow algorithms. We study… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp… Expand

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… Expand

Is this relevant?

Highly Cited

1972

Highly Cited

1972

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum… Expand

Is this relevant?