Orlin James B.

James B. Orlin

Information about the author James B. Orlin will soon be added to the site.
Found 48 papers in total
Solving inverse spanning tree problems through network flow techniques
Solving inverse spanning tree problems through network flow techniques
1999
Given a solution x * and an a priori estimated cost vector c , the inverse...
Optimized crossover for the independent set problem
Optimized crossover for the independent set problem
1997
We propose a knowledge-based crossover mechanism for genetic algorithms that exploits...
Algorithms for the simple equal flow problem
Algorithms for the simple equal flow problem
1999
The minimum cost flow problem is to determine a least cost shipment of a commodity...
Diagnosing infeasibilities in network flow problems
Diagnosing infeasibilities in network flow problems
1998
We consider the problem of finding a feasible flow in a directed network G = ( N,A )...
A scaling algorithm for multicommodity flow problems
A scaling algorithm for multicommodity flow problems
1998
We present a penalty-based algorithm that solves the muticommodity flow problem as a...
Computational investigations of maximum flow algorithms
Computational investigations of maximum flow algorithms
1997
The maximum flow algorithm is distinguished by the long line of successive...
A polynomial time primal network simplex algorithm for minimum cost flows
A polynomial time primal network simplex algorithm for minimum cost flows
1997
Developing a polynomial time primal network simplex algorithm for the minimum cost...
Use of representative operation counts in computational testing of algorithms
Use of representative operation counts in computational testing of algorithms
1996
In the mathematical programming literature, researchers have conducted a large number...
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
1997
In this paper, we study the primal and dual simplex algorithms for the maximum flow...
Toward an experimental method for algorithm simulation
Toward an experimental method for algorithm simulation
1996
This feature article surveys issues arising in the design, development, and execution...
Use of representative operation counts in computational testing of algorithms
Use of representative operation counts in computational testing of algorithms
1996
In the mathematical programming literature, researchers have conducted a large number...
A technique for speeding up the solution of the Lagrangean dual
A technique for speeding up the solution of the Lagrangean dual
1994
The authors propose techniques for the solution of the LP relaxation and the...
Faster algorithms for the shortest path problem
Faster algorithms for the shortest path problem
1990
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A...
Parallel algorithms for the assignment and minimum-cost flow problems
Parallel algorithms for the assignment and minimum-cost flow problems
1993
Let be a network for an assignment problem with 2 n nodes and m edges, in which the...
Determination of optimal vertices from feasible solutions in unimodular linear programming
Determination of optimal vertices from feasible solutions in unimodular linear programming
1993
In this paper the authors consider a linear programming problem with the underlying...
Polynomial dual network simplex algorithms
Polynomial dual network simplex algorithms
1993
The authors show how to use polynomial and strongly polynomial capacity scaling...
A faster strongly polynomial minimum cost flow algorithm
A faster strongly polynomial minimum cost flow algorithm
1993
This paper presents a new strongly polynomial time algorithm for the minimum cost flow...
Recognizing hidden bicircular networks
Recognizing hidden bicircular networks
1993
In this and a subsequent paper, the authors introduce a polynomial-time algorithm for...
New scaling algorithms for the assignment and minimum mean cycle problems
New scaling algorithms for the assignment and minimum mean cycle problems
1992
In this paper the authors suggest new scaling algorithms for the assignment and...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992
Several researchers have recently developed new techniques that give fast algorithms...
The scaling network simplex algorithm
The scaling network simplex algorithm
1992
In this paper, the authors present a new primal simplex pivot rule and analyze the...
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
1991
Until recently, fast algorithms for the maximum flow problem have typically proceeded...
Solving the linear matroid parity problem as a sequence of matroid intersection problems
Solving the linear matroid parity problem as a sequence of matroid intersection problems
1990
In this paper, the authors present an O( r 4 n) algorithm for the linear matroid...
A fast and simple algorithm for the maximum flow problem
A fast and simple algorithm for the maximum flow problem
1989
The authors present a simple sequential algorithm for the maximum flow problem on a...
Papers per page: