#### Filter Results:

- Full text PDF available (193)

#### Publication Year

1977

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (61)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- 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 the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n (m + n log n)) time.… (More)

- T J Hudson, L D Stein, +48 authors E S Lander
- Science
- 1995

A physical map has been constructed of the human genome containing 15,086 sequence-tagged sites (STSs), with an average spacing of 199 kilobases. The project involved assembly of a radiation hybrid map of the human genome containing 6193 loci and incorporated a genetic linkage map of the human genome containing 5264 loci. This information was combined with… (More)

We give evidence that Single Tranferable Vote (STV) is computation-ally resistant to manipulation: It is NP-complete to determine whether there exists a (possibly insincere) preference that will elect a favored candidate , even in an election for a single seat. Thus strategic voting under STV is qualitatively more difficult than under other commonly-used… (More)

- Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
- IPCO
- 1999

In this paper, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form Σ (i,j)∈Q ij ij F (w) + Σ i∈P i i B () µ), the constraints are similar to those arising in the dual of a minimum cost flow problem (that is, of the form µ i-µ j ≤ w ij , (i, j) ∈ Q), with lower and… (More)

- Charu C. Aggarwal, James B. Orlin
- Networks
- 2002

Let G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij < U on each arc (ij) E A. An elementary K-flow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A K-route flow is a flow from s to t that may be expressed as a non-negative linear sum of elementary K-flows. In… (More)

- Ravindra K. Ahuja, James B. Orlin
- Operations Research
- 2001

In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 be a given feasible solution. The solution x 0 may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to… (More)

- Richard M. Karp, James B. Orlin
- Discrete Applied Mathematics
- 1981

- 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 with <italic>n</italic> vertices, <italic>m</italic> edges, and nonnegative integer arc costs bounded by <italic>C</italic>, a one-level form of radix heap gives a… (More)

- James B. Orlin
- IPCO
- 2007

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 5 EO + n 6) time, where EO is the time to evaluate f(S) for some S ⊆ V. This improves the previous best strongly polynomial running time by more than a factor of n