| 2009 |
|---|
| 67 | EE | Satoru Iwata,
James B. Orlin:
A simple combinatorial algorithm for submodular function minimization.
SODA 2009: 1230-1237 |
| 66 | EE | Ravindra K. Ahuja,
Thomas L. Magnanti,
James B. Orlin:
Maximum Flow Problem.
Encyclopedia of Optimization 2009: 2009-2020 |
| 65 | EE | Ravindra K. Ahuja,
Thomas L. Magnanti,
James B. Orlin:
Minimum Cost Flow Problem.
Encyclopedia of Optimization 2009: 2095-2108 |
| 2008 |
|---|
| 64 | EE | James B. Orlin:
A Fast, Simpler Algorithm for the Matroid Parity Problem.
IPCO 2008: 240-258 |
| 63 | EE | Nir Halman,
Diego Klabjan,
Chung-Lun Li,
James B. Orlin,
David Simchi-Levi:
Fully polynomial time approximation schemes for stochastic dynamic programs.
SODA 2008: 700-709 |
| 62 | EE | Mahesh Kumar,
James B. Orlin:
Scale-invariant clustering with minimum volume ellipsoids.
Computers & OR 35(4): 1017-1029 (2008) |
| 61 | EE | Edmund K. Burke,
Moshe Dror,
James B. Orlin:
Scheduling malleable tasks with interdependent processing rates: Comments and observations.
Discrete Applied Mathematics 156(5): 620-626 (2008) |
| 60 | EE | James B. Orlin,
Andreas S. Schulz,
Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discrete Optimization 5(2): 550-561 (2008) |
| 59 | EE | Agustín Bompadre,
James B. Orlin:
A simple method for improving the primal simplex method for the multicommodity flow problem.
Networks 51(1): 63-77 (2008) |
| 58 | EE | Moshe Dror,
James B. Orlin:
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
SIAM J. Discrete Math. 21(4): 1019-1034 (2008) |
| 2007 |
|---|
| 57 | EE | James B. Orlin:
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.
IPCO 2007: 240-251 |
| 56 | EE | Murali S. Kodialam,
T. V. Lakshman,
James B. Orlin,
Sudipta Sengupta:
Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic.
IEEE Journal on Selected Areas in Communications 25(5): 934-948 (2007) |
| 2006 |
|---|
| 55 | EE | Murali S. Kodialam,
T. V. Lakshman,
James B. Orlin,
Sudipta Sengupta:
A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.
INFOCOM 2006 |
| 54 | EE | Murali S. Kodialam,
T. V. Lakshman,
James B. Orlin,
Sudipta Sengupta:
Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic.
INFOCOM 2006 |
| 53 | EE | Carol Meyers,
James B. Orlin:
Very Large-Scale Neighborhood Search Techniques in Timetabling Problems.
PATAT 2006: 24-39 |
| 52 | EE | Özlem Ergun,
James B. Orlin:
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem.
Discrete Optimization 3(1): 78-85 (2006) |
| 51 | EE | Agustín Bompadre,
Moshe Dror,
James B. Orlin:
Improved bounds for vehicle routing solutions.
Discrete Optimization 3(4): 299-316 (2006) |
| 50 | EE | Moshe Dror,
Yusin Lee,
James B. Orlin,
Valentin Polishchuk:
The Tsp and the Sum of its Marginal Values.
Int. J. Comput. Geometry Appl. 16(4): 333-344 (2006) |
| 49 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing.
J. ACM 53(1): 1-65 (2006) |
| 48 | EE | Özlem Ergun,
James B. Orlin,
Abran Steele-Feldman:
Creating very large scale neighborhoods out of smaller ones by compounding moves.
J. Heuristics 12(1-2): 115-140 (2006) |
| 47 | EE | Özlem Ergun,
James B. Orlin:
Fast neighborhood search for the single machine total weighted tardiness problem.
Oper. Res. Lett. 34(1): 41-45 (2006) |
| 2005 |
|---|
| 46 | EE | Agustín Bompadre,
James B. Orlin:
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.
IPCO 2005: 437-451 |
| 45 | EE | Ramkumar Ramaswamy,
James B. Orlin,
Nilopal Chakravarti:
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
Math. Program. 102(2): 355-369 (2005) |
| 2004 |
|---|
| 44 | EE | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate local search in combinatorial optimization.
SODA 2004: 587-596 |
| 43 | EE | Ravindra K. Ahuja,
Dorit S. Hochbaum,
James B. Orlin:
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica 39(3): 189-208 (2004) |
| 42 | EE | James B. Orlin,
Dushyant Sharma:
Extended neighborhood: Definition and characterization.
Math. Program. 101(3): 537-559 (2004) |
| 41 | EE | Ravindra K. Ahuja,
Jian Liu,
James B. Orlin,
Jon Goodstein,
Amit Mukherjee:
A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
Networks 44(2): 160-171 (2004) |
| 40 | EE | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput. 33(5): 1201-1214 (2004) |
| 2003 |
|---|
| 39 | EE | Ravindra K. Ahuja,
James B. Orlin,
Stefano Pallottino,
Maria Grazia Scutellà:
Dynamic shortest paths minimizing travel times and costs.
Networks 41(4): 197-205 (2003) |
| 38 | EE | Ravindra K. Ahuja,
James B. Orlin,
Dushyant Sharma:
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett. 31(3): 185-194 (2003) |
| 2002 |
|---|
| 37 | EE | Koen M. J. De Bontridder,
B. J. Lageweg,
Jan Karel Lenstra,
James B. Orlin,
Leen Stougie:
Branch-and-Bound Algorithms for the Test Cover Problem.
ESA 2002: 223-233 |
| 36 | EE | Neal E. Young,
Robert Endre Tarjan,
James B. Orlin:
Faster Parametric Shortest Path and Minimum Balance Algorithms
CoRR cs.DS/0205041: (2002) |
| 35 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing
CoRR cs.DS/0210013: (2002) |
| 34 | | Ravindra K. Ahuja,
Özlem Ergun,
James B. Orlin,
Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques.
Discrete Applied Mathematics 123(1-3): 75-102 (2002) |
| 33 | EE | Charu C. Aggarwal,
James B. Orlin:
On multiroute maximum flows in networks.
Networks 39(1): 43-52 (2002) |
| 32 | EE | Ravindra K. Ahuja,
James B. Orlin:
Combinatorial algorithms for inverse network flow problems.
Networks 40(4): 181-187 (2002) |
| 31 | EE | Ravindra K. Ahuja,
James B. Orlin,
Prabha Sharma,
P. T. Sokkalingam:
A network simplex algorithm with O(n) consecutive degenerate pivots.
Oper. Res. Lett. 30(3): 141-148 (2002) |
| 2000 |
|---|
| 30 | EE | János Csirik,
David S. Johnson,
Claire Kenyon,
James B. Orlin,
Peter W. Shor,
Richard R. Weber:
On the sum-of-squares algorithm for bin packing.
STOC 2000: 208-217 |
| 29 | EE | James B. Orlin,
Andreas S. Schulz,
Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
STOC 2000: 565-572 |
| 28 | EE | Ravindra K. Ahuja,
James B. Orlin,
Ashish Tiwari:
A greedy genetic algorithm for the quadratic assignment problem.
Computers & OR 27(10): 917-934 (2000) |
| 27 | | Ravindra K. Ahuja,
James B. Orlin:
A Faster Algorithm for the Inverse Spanning Tree Problem.
J. Algorithms 34(1): 177-193 (2000) |
| 26 | EE | P. T. Sokkalingam,
Ravindra K. Ahuja,
James B. Orlin:
New polynomial-time cycle-canceling algorithms for minimum-cost flows.
Networks 36(1): 53-63 (2000) |
| 25 | EE | Lisa Fleischer,
James B. Orlin:
Optimal Rounding of Instantaneous Fractional Flows Over Time.
SIAM J. Discrete Math. 13(2): 145-153 (2000) |
| 1999 |
|---|
| 24 | EE | Ravindra K. Ahuja,
Dorit S. Hochbaum,
James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem.
IPCO 1999: 31-44 |
| 1998 |
|---|
| 23 | | Charu C. Aggarwal,
Ravindra K. Ahuja,
Jianxiu Hao,
James B. Orlin:
Diagnosing infeasibilities in network flow problems.
Math. Program. 81: 263-280 (1998) |
| 1997 |
|---|
| 22 | EE | Ravindra K. Ahuja,
James B. Orlin:
Developing Fitter Genetic Algorithms.
INFORMS Journal on Computing 9(3): 251-253 (1997) |
| 21 | | James B. Orlin:
A polynomial time primal network simplex algorithm for minimum cost flows.
Math. Program. 77: 109-129 (1997) |
| 1996 |
|---|
| 20 | | James B. Orlin:
A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).
SODA 1996: 474-481 |
| 1994 |
|---|
| 19 | | Jianxiu Hao,
James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
J. Algorithms 17(3): 424-446 (1994) |
| 18 | | Dimitris Bertsimas,
James B. Orlin:
A technique for speeding up the solution of the Lagrangean dual.
Math. Program. 63: 23-45 (1994) |
| 17 | | Ravindra K. Ahuja,
James B. Orlin,
Clifford Stein,
Robert Endre Tarjan:
Improved Algorithms for Bipartite Network Flow.
SIAM J. Comput. 23(5): 906-933 (1994) |
| 1993 |
|---|
| 16 | EE | Randy Shull,
Alan Shuchat,
James B. Orlin,
Marianne Lepp:
Recognizing Hidden Bicircular Networks.
Discrete Applied Mathematics 41(1): 13-53 (1993) |
| 15 | | Shinji Mizuno,
Romesh Saigal,
James B. Orlin:
Determination of optimal vertices from feasible solutions in unimodular linear programming.
Math. Program. 59: 23-31 (1993) |
| 14 | | James B. Orlin,
Serge A. Plotkin,
Éva Tardos:
Polynomial dual network simplex algorithms.
Math. Program. 60: 255-276 (1993) |
| 1992 |
|---|
| 13 | | Dimitris Bertsimas,
James B. Orlin:
A Technique for Speeding up the Solution of the Lagrangian Dual.
IPCO 1992: 435-452 |
| 12 | EE | Jianxiu Hao,
James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Graph.
SODA 1992: 165-174 |
| 11 | | Ravindra K. Ahuja,
Andrew V. Goldberg,
James B. Orlin,
Robert Endre Tarjan:
Finding minimum-cost flows by double scaling.
Math. Program. 53: 243-266 (1992) |
| 10 | | James B. Orlin,
Ravindra K. Ahuja:
New scaling algorithms for the assignment and minimum mean cycle problems.
Math. Program. 54: 41-56 (1992) |
| 1991 |
|---|
| 9 | | Murali S. Kodialam,
James B. Orlin:
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming.
SODA 1991: 131-135 |
| 1990 |
|---|
| 8 | EE | Ravindra K. Ahuja,
Kurt Mehlhorn,
James B. Orlin,
Robert Endre Tarjan:
Faster Algorithms for the Shortest Path Problem
J. ACM 37(2): 213-223 (1990) |
| 7 | | James B. Orlin,
John H. Vande Vate:
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.
Math. Program. 47: 81-106 (1990) |
| 1989 |
|---|
| 6 | EE | Randy Shull,
James B. Orlin,
Alan Shuchat,
Marianne L. Gardner:
The structure of bases in bicircular matroids.
Discrete Applied Mathematics 23(3): 267-283 (1989) |
| 5 | | Ravindra K. Ahuja,
James B. Orlin,
Robert Endre Tarjan:
Improved Time Bounds for the Maximum Flow Problem.
SIAM J. Comput. 18(5): 939-954 (1989) |
| 1988 |
|---|
| 4 | | James B. Orlin:
A Faster Strongly Polynominal Minimum Cost Flow Algorithm
STOC 1988: 377-387 |
| 1985 |
|---|
| 3 | | Z. Miller,
James B. Orlin:
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.
J. Algorithms 6(1): 10-16 (1985) |
| 1981 |
|---|
| 2 | | James B. Orlin:
The Complexity of Dynamic Languages and Dynamic Optimization Problems
STOC 1981: 218-227 |
| 1978 |
|---|
| 1 | EE | James B. Orlin:
Line-digraphs, arborescences, and theorems of tutte and knuth.
J. Comb. Theory, Ser. B 25(2): 187-198 (1978) |
