#### Filter Results:

- Full text PDF available (129)

#### Publication Year

1973

2018

- This year (2)
- Last 5 years (15)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

By Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin : Network Flows: Theory, Algorithms, and Applications bringing together the classic and the contemporary aspects of the field thisâ€¦ (More)

- James B. Orlin
- STOC
- 1988

We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flowâ€¦ (More)

- Ravindra K. Ahuja, Ã–zlem Ergun, James B. Orlin, Abraham P. Punnen
- Discrete Applied Mathematics
- 2002

Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that canâ€¦ (More)

- Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan
- J. ACM
- 1990

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a networkâ€¦ (More)

- Neal E. Young, Robert E. Tarjan, James B. Orlin
- Networks
- 1991

We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneiderâ€™s minimum-balance algorithm to obtainâ€¦ (More)

- Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
- Math. Program.
- 2001

The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. Theâ€¦ (More)

- James B. Orlin
- Math. Program.
- 2009

We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n EO + n) time, where EO is the time to evaluateâ€¦ (More)

- Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
- Computers & OR
- 2000

The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. In this paper, we suggest a genetic algorithm for the QAPâ€¦ (More)

- Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia ScutellÃ
- Management Science
- 2004

This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced byâ€¦ (More)

This paper develops the theory of cyclic transfers, a neighborhood search strategy for a broad class of combinatorial problems. The problem class is characterized by a two-phase decision process:â€¦ (More)