Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

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

2011

Highly Cited

2011

1 Defining Network Flow A flow network is a directed graph G = (V,E) in which each edge (u, v) ∈ E has non-negative capacity c(u… Expand

Highly Cited

2011

Highly Cited

2011

In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are… Expand

Highly Cited

2008

Highly Cited

2008

We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a… Expand

Highly Cited

2005

Highly Cited

2005

Centrality measures, or at least popular interpretations of these measures, make implicit assumptions about the manner in which… Expand

Highly Cited

2003

Highly Cited

2003

Abstract.We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows… Expand

Highly Cited

1977

Highly Cited

1977

One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and… Expand

Highly Cited

1975

Highly Cited

1975

An algorithm of Dinic for finding the maximum flow in a network is described. It is then shown that if the vertex capacities are… Expand

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

Highly Cited

1962

Highly Cited

1962

In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network… Expand

Highly Cited

1956

Highly Cited

1956

Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of… Expand