Orlin, James B. 1953
Overview
Works:  101 works in 203 publications in 3 languages and 869 library holdings 

Roles:  Author, Contributor 
Classifications:  T57.85, 658.4032 
Publication Timeline
.
Most widely held works by
James B Orlin
Network flows : theory, algorithms, and applications by
Ravindra K Ahuja(
Book
)
25 editions published between 1993 and 2014 in English and Italian and held by 635 WorldCat member libraries worldwide
Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and accessible to a wider audience, the authors prefer to adopt a network or graphical viewpoint rather than relying on a linear programming approach
25 editions published between 1993 and 2014 in English and Italian and held by 635 WorldCat member libraries worldwide
Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and accessible to a wider audience, the authors prefer to adopt a network or graphical viewpoint rather than relying on a linear programming approach
Polynomial dual network simplex algorithms by
James B Orlin(
Book
)
7 editions published in 1991 in English and held by 24 WorldCat member libraries worldwide
Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n)) time implementation of a strategy that requires somewhat more pivots."
7 editions published in 1991 in English and held by 24 WorldCat member libraries worldwide
Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n)) time implementation of a strategy that requires somewhat more pivots."
New Classes of Complete Problems for the Second Level of the Polynomial Hierarchy by Berit Johannes(
)
1 edition published in 2011 in English and held by 15 WorldCat member libraries worldwide
1 edition published in 2011 in English and held by 15 WorldCat member libraries worldwide
Improved time bounds for the maximum flow problem by
Ravindra K Ahuja(
Book
)
7 editions published between 1987 and 1988 in English and held by 10 WorldCat member libraries worldwide
"An awardwinning author and veteran mountain climber takes us deep into the Southwest backcountry to uncover secrets of its ancient inhabitants. In The Lost World of the Old Ones, David Roberts expands and updates the research from his 1996 classic, In Search of the Old Ones. As he elucidates startling archaeological breakthroughs, Roberts also recounts his past twenty years of farflung exploits in search of spectacular prehistoric ruins and rockart panels known to very few modern travelers. His adventures range across Utah, Arizona, New Mexico, and southwestern Colorado and illuminate the mysteries of the Ancestral Puebloans and their contemporary neighbors the Mogollon and Fremont, as well as of the more recent Navajo and Comanche. Roberts uses his climbing and exploratory knowhow to reach the remote sanctuaries of the Old Ones hidden high on nearly vertical cliffs, many of which are unknown to archaeologists and park rangers. As a passionate advocate for an experiential encounter with history, Roberts mixes the findings of experts with personal explorations to raise questions that archaeologists have yet to address"Provided by publisher
7 editions published between 1987 and 1988 in English and held by 10 WorldCat member libraries worldwide
"An awardwinning author and veteran mountain climber takes us deep into the Southwest backcountry to uncover secrets of its ancient inhabitants. In The Lost World of the Old Ones, David Roberts expands and updates the research from his 1996 classic, In Search of the Old Ones. As he elucidates startling archaeological breakthroughs, Roberts also recounts his past twenty years of farflung exploits in search of spectacular prehistoric ruins and rockart panels known to very few modern travelers. His adventures range across Utah, Arizona, New Mexico, and southwestern Colorado and illuminate the mysteries of the Ancestral Puebloans and their contemporary neighbors the Mogollon and Fremont, as well as of the more recent Navajo and Comanche. Roberts uses his climbing and exploratory knowhow to reach the remote sanctuaries of the Old Ones hidden high on nearly vertical cliffs, many of which are unknown to archaeologists and park rangers. As a passionate advocate for an experiential encounter with history, Roberts mixes the findings of experts with personal explorations to raise questions that archaeologists have yet to address"Provided by publisher
Genuinely polynomial simplex and nonsimplex algorithms for the minimum cost flow problem by
James B Orlin(
Book
)
8 editions published between 1984 and 1985 in English and Dutch and held by 9 WorldCat member libraries worldwide
8 editions published between 1984 and 1985 in English and Dutch and held by 9 WorldCat member libraries worldwide
On multiroute maximum flows in networks by
Charu C Aggarwal(
Book
)
4 editions published between 1997 and 2000 in English and held by 8 WorldCat member libraries worldwide
Abstract: "Let G=(N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity u[subscript ij] on each arc (i, j)[element of]A. An elementary Kflow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A Kroute flow is a flow from s to t that may be expressed as a nonnegative linear sum of elementary Kflows. In this paper, we show how to determine a maximum Kroute flow as a sequence of O(min[log nU, K]) maximum flow problems. This improves upon the algorithm by Kishimoto, which solves this problem as a sequence of K maximum flow problems. In addition, we have simplified and extended some of the basic theory. We also discuss the application of our technique to Birkhoff's theorem and a scheduling problem."
4 editions published between 1997 and 2000 in English and held by 8 WorldCat member libraries worldwide
Abstract: "Let G=(N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity u[subscript ij] on each arc (i, j)[element of]A. An elementary Kflow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A Kroute flow is a flow from s to t that may be expressed as a nonnegative linear sum of elementary Kflows. In this paper, we show how to determine a maximum Kroute flow as a sequence of O(min[log nU, K]) maximum flow problems. This improves upon the algorithm by Kishimoto, which solves this problem as a sequence of K maximum flow problems. In addition, we have simplified and extended some of the basic theory. We also discuss the application of our technique to Birkhoff's theorem and a scheduling problem."
Network flows by
Ravindra K Ahuja(
Book
)
4 editions published between 1988 and 2011 in English and held by 8 WorldCat member libraries worldwide
4 editions published between 1988 and 2011 in English and held by 8 WorldCat member libraries worldwide
A faster strongly polynomial minimum cost flow algorithm by
James B Orlin(
Book
)
7 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide
We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the EdmondsKarp 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. Using a standard transformation, this approach yields an O(m log n (m + n log n)) algorithm for the capacitated minimum cost flow problem. This algorithm improves the best previous strongly polynomial algorithm due to Galil and Tardos, by a factor of n2/m. Our algorithm for the capacitated minimum cost flow problem is even more efficient if the number of arcs with finite upper bounds, say m', is much less than m. In this case, the number of shortest path problems solved is O((m + n) log n)
7 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide
We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the EdmondsKarp 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. Using a standard transformation, this approach yields an O(m log n (m + n log n)) algorithm for the capacitated minimum cost flow problem. This algorithm improves the best previous strongly polynomial algorithm due to Galil and Tardos, by a factor of n2/m. Our algorithm for the capacitated minimum cost flow problem is even more efficient if the number of arcs with finite upper bounds, say m', is much less than m. In this case, the number of shortest path problems solved is O((m + n) log n)
A fast and simple algorithm for the maximum flow problem by
Ravindra K Ahuja(
Book
)
5 editions published between 1987 and 1988 in English and held by 6 WorldCat member libraries worldwide
5 editions published between 1987 and 1988 in English and held by 6 WorldCat member libraries worldwide
Decentralized algorithms for the management and control of transportation systems by
Ismaïl Chabini(
Book
)
2 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
On the variation of the barometer effect of the hard cosmic ray component with zenith angle by
Bjørn Trumpy(
Book
)
1 edition published in 1941 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1941 in English and held by 5 WorldCat member libraries worldwide
The complexity of dynamic/periodic languages and optimization problems by
James B Orlin(
Book
)
5 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
5 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
Some recent advances in network flows by
Ravindra K Ahuja(
Book
)
2 editions published in 1989 in Undetermined and English and held by 4 WorldCat member libraries worldwide
2 editions published in 1989 in Undetermined and English and held by 4 WorldCat member libraries worldwide
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems by
Ravindra K Ahuja(
Book
)
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
A technique for speeding up the solution of the Lagrangean dual by
Dimitris Bertsimas(
Book
)
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
We propose new techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain structure our techniques find not only the optimal solution value, but the solution as well. Our techniques lead to significant improvements in running time compared with previously known methods (interior point methods, Ellipsoid algorithm, Vaidyas algorithm). We apply our method to the solution of the LP relaxation and the Lagrangean dual of several classical combinatorial problems, like the traveling salesman problem, the vehicle routing problem, the Steiner tree problem, the kconnected problem, multicommodity flows, network design problems, network flow problems with side constraints, facility location problems, Kpolymatroid intersection, multiple item capacitated lot sizing problem, etc. In all these applications our techniques significantly improve the running time and yield the fastest way to solve them
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
We propose new techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain structure our techniques find not only the optimal solution value, but the solution as well. Our techniques lead to significant improvements in running time compared with previously known methods (interior point methods, Ellipsoid algorithm, Vaidyas algorithm). We apply our method to the solution of the LP relaxation and the Lagrangean dual of several classical combinatorial problems, like the traveling salesman problem, the vehicle routing problem, the Steiner tree problem, the kconnected problem, multicommodity flows, network design problems, network flow problems with side constraints, facility location problems, Kpolymatroid intersection, multiple item capacitated lot sizing problem, etc. In all these applications our techniques significantly improve the running time and yield the fastest way to solve them
Faster algorithms for the shortest path problem by
Ravindra K Ahuja(
Book
)
3 editions published between 1988 and 2011 in English and held by 4 WorldCat member libraries worldwide
This document investigates efficient implementations of Dijkstra's shortest path algorithm. The authors propose a new data structure, called the redistributive heap, for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a onelevel form of redistributive heap give a time bound of Dijkstra's algorithm of O(m + n log C). A twolevel form of redistributive heap give a bound of O(m + n log C / log log C). A combination of a redistributive heap and a previously known data structure called a Fibonacci heap gives a bound of O(m + n square root of (log C)). The best previously known bounds are O(m + n log n) using Fibonacci heaps alone and O(m log log C) using the priority queue structure of Van Emde Boas, Kaas, and Zijlstra
3 editions published between 1988 and 2011 in English and held by 4 WorldCat member libraries worldwide
This document investigates efficient implementations of Dijkstra's shortest path algorithm. The authors propose a new data structure, called the redistributive heap, for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a onelevel form of redistributive heap give a time bound of Dijkstra's algorithm of O(m + n log C). A twolevel form of redistributive heap give a bound of O(m + n log C / log log C). A combination of a redistributive heap and a previously known data structure called a Fibonacci heap gives a bound of O(m + n square root of (log C)). The best previously known bounds are O(m + n log n) using Fibonacci heaps alone and O(m log log C) using the priority queue structure of Van Emde Boas, Kaas, and Zijlstra
A dual version of Tardo's algorithms for linear programming by
James B Orlin(
Book
)
4 editions published between 1985 and 1986 in English and Dutch and held by 4 WorldCat member libraries worldwide
4 editions published between 1985 and 1986 in English and Dutch and held by 4 WorldCat member libraries worldwide
Some very easy knapsack/partition problems by
James B Orlin(
Book
)
3 editions published between 1983 and 1984 in English and Dutch and held by 3 WorldCat member libraries worldwide
3 editions published between 1983 and 1984 in English and Dutch and held by 3 WorldCat member libraries worldwide
Finding minimumcost flows by double scaling by
Ravindra K Ahuja(
Book
)
3 editions published in 1988 in English and held by 3 WorldCat member libraries worldwide
Several researchers have recently developed new techniques that give fast algorithms for the minimumcost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and maximum arc cost magnitude C. The major techniques used are the capacityscaling approach of Edmonds and Karp, the excessscaling approach of Ahuja and Orlin, the costscaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Tarjan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (uncapacitated) transportation problem. In addition, we discuss a capacitybounding approach to the minimum cost flow problem. (KR)
3 editions published in 1988 in English and held by 3 WorldCat member libraries worldwide
Several researchers have recently developed new techniques that give fast algorithms for the minimumcost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and maximum arc cost magnitude C. The major techniques used are the capacityscaling approach of Edmonds and Karp, the excessscaling approach of Ahuja and Orlin, the costscaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Tarjan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (uncapacitated) transportation problem. In addition, we discuss a capacitybounding approach to the minimum cost flow problem. (KR)
Application of the analogy between water flow with a free surface and twodimensional compressible gas flow by W. James Orlin(
)
2 editions published in 1947 in English and held by 3 WorldCat member libraries worldwide
The theory of the hydraulic analogythat is the analogy between water flow with a free surface and twodimensional compressible gas flow and the limitations and conditions of the analogy are discussed. A test was run using the hydraulic analogy as applied to the flow about circular cylinders of various diameters at subsonic velocities extending into the supercritical range. The apparatus and techniques used in this application are described and criticized. Reasonably satisfactory agreement of pressure distributions and flow fields existed between water and airflow about corresponding bodies. This agreement indicated the possibility of extending experimental compressibility research by new methods
2 editions published in 1947 in English and held by 3 WorldCat member libraries worldwide
The theory of the hydraulic analogythat is the analogy between water flow with a free surface and twodimensional compressible gas flow and the limitations and conditions of the analogy are discussed. A test was run using the hydraulic analogy as applied to the flow about circular cylinders of various diameters at subsonic velocities extending into the supercritical range. The apparatus and techniques used in this application are described and criticized. Reasonably satisfactory agreement of pressure distributions and flow fields existed between water and airflow about corresponding bodies. This agreement indicated the possibility of extending experimental compressibility research by new methods
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Ahuja, Ravindra K. 1956 Author Contributor Creator
 Magnanti, Thomas L. Author
 Sloan School of Management
 Plotkin, Serge A.
 Tardos, Éva
 Tarjan, Robert E. (Robert Endre) 1948 Contributor
 Johannes, Berit Author
 Aggarwal, Charu C. Author
 Massachusetts Institute of Technology Operations Research Center
 STANFORD UNIV CA Dept. of COMPUTER SCIENCE
Useful Links
Associated Subjects
Algorithms Analogy Antiquities Computer algorithms Computer networks Critical path analysis Data flow computing Data structures (Computer science) Gas flow Graph theory Indians of North AmericaAntiquities Mathematical optimization Network analysis (Planning) Network analysis (Planning)Mathematical models Problem solving Pueblo IndiansAntiquities Roberts, David, Rock paintings Route choiceMathematical models Sacred space Southwest, New System analysis Traffic assignmentMathematical models Travel Travel time (Traffic engineering)Mathematical models