default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames B. Orlin
Person information
- affiliation: MIT, Cambridge, USA
- award (1993): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j110]James B. Orlin
, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. J. ACM 70(1): 3:1-3:33 (2023)- [i9]Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin:
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. CoRR abs/2307.15702 (2023) - 2021
- [j109]James B. Orlin, Xiao-Yue Gong:
A fast maximum flow algorithm. Networks 77(2): 287-321 (2021) - [c28]James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. SODA 2021: 235-254 - [c27]Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf:
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - 2020
- [c26]Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi:
Distributionally Robust Max Flows. SOSA 2020: 81-90 - [i8]James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. CoRR abs/2007.07975 (2020)
2010 – 2019
- 2019
- [i7]James B. Orlin, Xiao-Yue Gong:
A Fast Max Flow Algorithm. CoRR abs/1910.04848 (2019) - 2018
- [j108]James B. Orlin, K. Subramani, Piotr Wojciechowski:
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236: 387-394 (2018) - [j107]Nir Halman, Giacomo Nannicini, James B. Orlin:
On the complexity of energy storage problems. Discret. Optim. 28: 31-53 (2018) - [j106]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust monotone submodular function maximization. Math. Program. 172(1-2): 505-537 (2018) - [p1]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 311-326 - 2017
- [c25]James B. Orlin, Antonio Sedeño-Noda:
An O(nm) time algorithm for finding the min length directed cycle in a graph. SODA 2017: 1866-1879 - 2016
- [j105]Imke Joormann, James B. Orlin, Marc E. Pfetsch:
A characterization of irreducible infeasible subsystems in flow networks. Networks 68(2): 121-129 (2016) - [j104]Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin:
On the power of randomization in network interdiction. Oper. Res. Lett. 44(1): 114-120 (2016) - [c24]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. IPCO 2016: 312-324 - 2015
- [j103]Nir Halman, Giacomo Nannicini, James B. Orlin:
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25(1): 317-350 (2015) - [i6]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. CoRR abs/1507.06616 (2015) - 2014
- [j102]Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi:
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. SIAM J. Discret. Math. 28(4): 1725-1796 (2014) - 2013
- [j101]Edith Elkind, James B. Orlin:
On the hardness of finding subsets with equal average. Inf. Process. Lett. 113(13): 477-480 (2013) - [j100]Dorit S. Hochbaum, James B. Orlin:
Simplifications and speedups of the pseudoflow algorithm. Networks 61(1): 40-57 (2013) - [j99]James B. Orlin, Balachandran Vaidyanathan:
Fast algorithms for convex cost flow problems on circles, lines, and trees. Networks 62(4): 288-296 (2013) - [c23]Nir Halman, Giacomo Nannicini, James B. Orlin:
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA 2013: 577-588 - [c22]James B. Orlin:
Max flows in O(nm) time, or better. STOC 2013: 765-774 - [i5]Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin:
On the power of randomization in network interdiction. CoRR abs/1312.3478 (2013) - [i4]Ebrahim Nasrabadi, James B. Orlin:
Robust optimization with incremental recourse. CoRR abs/1312.4075 (2013) - 2012
- [j98]Nir Halman, James B. Orlin, David Simchi-Levi:
Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle. Oper. Res. 60(2): 429-446 (2012) - [j97]Mehdi Ghiyasvand, James B. Orlin:
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices. Oper. Res. 60(5): 1245-1248 (2012) - 2011
- [j96]Martin Milanic, James B. Orlin, Gábor Rudolf:
Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188(1): 359-370 (2011) - [j95]Woonghee Tim Huh, Retsef Levi, Paat Rusmevichientong, James B. Orlin:
Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator. Oper. Res. 59(4): 929-941 (2011) - [j94]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta:
End-to-end restorable oblivious routing of hose model traffic. IEEE/ACM Trans. Netw. 19(4): 1223-1236 (2011) - 2010
- [j93]Moshe Dror, James B. Orlin, Michael Zhu:
Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem. Discret. Math. Algorithms Appl. 2(2): 189-198 (2010) - [j92]James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson:
A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8(2): 189-198 (2010) - [c21]James B. Orlin:
Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. STOC 2010: 291-300 - [i3]James B. Orlin:
Improved Algorithms for Computing Fisher's Market Clearing Prices. Equilibrium Computation 2010
2000 – 2009
- 2009
- [j91]Onur Seref, Ravindra K. Ahuja, James B. Orlin:
Incremental Network Optimization: Theory and Algorithms. Oper. Res. 57(3): 586-594 (2009) - [j90]Nir Halman, Diego Klabjan, Mohamed Mostagir, James B. Orlin, David Simchi-Levi:
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand. Math. Oper. Res. 34(3): 674-685 (2009) - [j89]James B. Orlin:
A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118(2): 237-251 (2009) - [j88]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta:
Oblivious routing of highly variable traffic in service overlays and IP backbones. IEEE/ACM Trans. Netw. 17(2): 459-472 (2009) - [c20]Satoru Iwata, James B. Orlin:
A simple combinatorial algorithm for submodular function minimization. SODA 2009: 1230-1237 - [c19]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Integer Programming: Optimization and Evaluation Are Equivalent. WADS 2009: 519-529 - [r4]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Maximum Flow Problem. Encyclopedia of Optimization 2009: 2009-2020 - [r3]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Minimum Cost Flow Problem. Encyclopedia of Optimization 2009: 2095-2108 - 2008
- [j87]Mahesh Kumar, James B. Orlin:
Scale-invariant clustering with minimum volume ellipsoids. Comput. Oper. Res. 35(4): 1017-1029 (2008) - [j86]Edmund K. Burke, Moshe Dror, James B. Orlin:
Scheduling malleable tasks with interdependent processing rates: Comments and observations. Discret. Appl. Math. 156(5): 620-626 (2008) - [j85]James B. Orlin, Andreas S. Schulz, Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. Discret. Optim. 5(2): 550-561 (2008) - [j84]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) - [j83]Moshe Dror, James B. Orlin:
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets. SIAM J. Discret. Math. 21(4): 1019-1034 (2008) - [j82]Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin:
The Locomotive Routing Problem. Transp. Sci. 42(4): 492-507 (2008) - [c18]James B. Orlin:
A Fast, Simpler Algorithm for the Matroid Parity Problem. IPCO 2008: 240-258 - [c17]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 - 2007
- [j81]Ravindra K. Ahuja, Jon Goodstein, Amit Mukherjee, James B. Orlin, Dushyant Sharma:
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. INFORMS J. Comput. 19(3): 416-428 (2007) - [j80]Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma:
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. INFORMS J. Comput. 19(4): 646-657 (2007) - [j79]Dritan Nace, James B. Orlin:
Lexicographically Minimum and Maximum Load Linear Programming Problems. Oper. Res. 55(1): 182-187 (2007) - [j78]Ravindra K. Ahuja, Arvind Kumar, Krishna C. Jha, James B. Orlin:
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. Oper. Res. 55(6): 1136-1146 (2007) - [j77]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta:
Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic. IEEE J. Sel. Areas Commun. 25(5): 934-948 (2007) - [c16]James B. Orlin:
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. IPCO 2007: 240-251 - [r2]Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja:
Very Large-Scale Neighborhood Search. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j76]Özlem Ergun, James B. Orlin:
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discret. Optim. 3(1): 78-85 (2006) - [j75]Agustín Bompadre, Moshe Dror, James B. Orlin:
Improved bounds for vehicle routing solutions. Discret. Optim. 3(4): 299-316 (2006) - [j74]Ö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) - [j73]Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk:
The Tsp and the Sum of its Marginal Values. Int. J. Comput. Geom. Appl. 16(4): 333-344 (2006) - [j72]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) - [j71]Özlem Ergun, James B. Orlin:
Fast neighborhood search for the single machine total weighted tardiness problem. Oper. Res. Lett. 34(1): 41-45 (2006) - [c15]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 - [c14]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 - [c13]Carol Meyers, James B. Orlin:
Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. PATAT 2006: 24-39 - 2005
- [j70]Robert G. Bland, James B. Orlin:
IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson. Int. Trans. Oper. Res. 12(3): 367-372 (2005) - [j69]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) - [j68]Ravindra K. Ahuja, Jian Liu, James B. Orlin, Dushyant Sharma, Larry A. Shughart:
Solving Real-Life Locomotive-Scheduling Problems. Transp. Sci. 39(4): 503-517 (2005) - [c12]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 - 2004
- [j67]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) - [j66]Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà:
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem. Manag. Sci. 50(6): 749-760 (2004) - [j65]James B. Orlin, Dushyant Sharma:
Extended neighborhood: Definition and characterization. Math. Program. 101(3): 537-559 (2004) - [j64]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) - [j63]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33(5): 1201-1214 (2004) - [c11]James B. Orlin, Abraham P. Punnen, Andreas S. Schulz:
Approximate local search in combinatorial optimization. SODA 2004: 587-596 - 2003
- [j62]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. Manag. Sci. 49(7): 950-964 (2003) - [j61]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) - [j60]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
- [j59]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1-3): 75-102 (2002) - [j58]Charu C. Aggarwal, James B. Orlin:
On multiroute maximum flows in networks. Networks 39(1): 43-52 (2002) - [j57]Ravindra K. Ahuja, James B. Orlin:
Combinatorial algorithms for inverse network flow problems. Networks 40(4): 181-187 (2002) - [j56]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) - [j55]Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà:
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. Transp. Sci. 36(3): 326-336 (2002) - [c10]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 - [i2]Neal E. Young, Robert Endre Tarjan, James B. Orlin:
Faster Parametric Shortest Path and Minimum Balance Algorithms. CoRR cs.DS/0205041 (2002) - [i1]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) - 2001
- [j54]Ravindra K. Ahuja, James B. Orlin:
Inverse Optimization. Oper. Res. 49(5): 771-783 (2001) - [j53]Ravindra K. Ahuja, James B. Orlin:
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints. Oper. Res. 49(5): 784-789 (2001) - [j52]Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma:
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91(1): 71-97 (2001) - 2000
- [j51]Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari:
A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27(10): 917-934 (2000) - [j50]Ravindra K. Ahuja, James B. Orlin:
A Faster Algorithm for the Inverse Spanning Tree Problem. J. Algorithms 34(1): 177-193 (2000) - [j49]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) - [j48]Lisa Fleischer, James B. Orlin:
Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discret. Math. 13(2): 145-153 (2000) - [c9]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 - [c8]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
1990 – 1999
- 1999
- [j47]P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin:
Solving Inverse Spanning Tree Problems Through Network Flow Techniques. Oper. Res. 47(2): 291-298 (1999) - [c7]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. IPCO 1999: 31-44 - [r1]James B. Orlin, Ravindra K. Ahuja, David Simchi-Levi, Sunil Chopra, Bruce L. Golden, B. K. Kaku:
Networks And Flows. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j46]Rina R. Schneur, James B. Orlin:
A Scaling Algorithm for Multicommodity Flow Problems. Oper. Res. 46(2): 231-246 (1998) - [j45]Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin:
Diagnosing infeasibilities in network flow problems. Math. Program. 81: 263-280 (1998) - 1997
- [j44]Ravindra K. Ahuja, James B. Orlin:
Developing Fitter Genetic Algorithms. INFORMS J. Comput. 9(3): 251-253 (1997) - [j43]Paul Mireault, James B. Orlin, Rakesh V. Vohra:
A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines. Oper. Res. 45(1): 116-125 (1997) - [j42]Charu C. Aggarwal, James B. Orlin, Ray P. Tai:
Optimized Crossover for the Independent Set Problem. Oper. Res. 45(2): 226-234 (1997) - [j41]Donald Goldfarb, Zhiying Jin, James B. Orlin:
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 22(4): 793-802 (1997) - [j40]James B. Orlin:
A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 77: 109-129 (1997) - [j39]Ravindra K. Ahuja, James B. Orlin:
Equivalence of the primal and dual simplex algorithms for the maximum flow problem. Oper. Res. Lett. 20(3): 101-108 (1997) - 1996
- [j38]James B. Orlin:
Commentary - On Experimental Methods for Algorithm Simulation. INFORMS J. Comput. 8(1): 21-23 (1996) - [j37]Ravindra K. Ahuja, James B. Orlin:
Use of Representative Operation Counts in Computational Testing of Algorithms. INFORMS J. Comput. 8(3): 318-330 (1996) - [c6]James B. Orlin:
A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). SODA 1996: 474-481 - 1995
- [j36]Ravindra K. Ahuja, James B. Orlin:
A capacity scaling algorithm for the constrained maximum flow problem. Networks 25(2): 89-98 (1995) - 1994
- [j35]Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17(3): 424-446 (1994) - [j34]Dimitris Bertsimas, James B. Orlin:
A technique for speeding up the solution of the Lagrangean dual. Math. Program. 63: 23-45 (1994) - [j33]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
- [b1]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Network flows - theory, algorithms and applications. Prentice Hall 1993, ISBN 978-0-13-617549-0, pp. I-XV, 1-846 - [j32]Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp:
Recognizing Hidden Bicircular Networks. Discret. Appl. Math. 41(1): 13-53 (1993) - [j31]James B. Orlin:
A Faster Strongly Polynomial Minimum Cost Flow Algorithm. Oper. Res. 41(2): 338-350 (1993) - [j30]Shinji Mizuno, Romesh Saigal, James B. Orlin:
Determination of optimal vertices from feasible solutions in unimodular linear programming. Math. Program. 59: 23-31 (1993) - [j29]James B. Orlin, Serge A. Plotkin, Éva Tardos:
Polynomial dual network simplex algorithms. Math. Program. 60: 255-276 (1993) - [j28]Mark Hartmann, James B. Orlin:
Finding minimum cost to time ratio cycles with small integral transit times. Networks 23(6): 567-574 (1993) - [j27]James B. Orlin, Clifford Stein:
Parallel algorithms for the assignment and minimum-cost flow problems. Oper. Res. Lett. 14(4): 181-186 (1993) - 1992
- [j26]Ravindra K. Ahuja, James B. Orlin:
The Scaling Network Simplex Algorithm. Oper. Res. 40(Supplement-1): S5-S13 (1992) - [j25]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) - [j24]James B. Orlin, Ravindra K. Ahuja:
New scaling algorithms for the assignment and minimum mean cycle problems. Math. Program. 54: 41-56 (1992) - [c5]Dimitris Bertsimas, James B. Orlin:
A Technique for Speeding up the Solution of the Lagrangian Dual. IPCO 1992: 435-452 - [c4]Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Graph. SODA 1992: 165-174 - 1991
- [j23]Neal E. Young, Robert Endre Tarjan, James B. Orlin:
Faster parametric shortest path and minimum-balance algorithms. Networks 21(2): 205-221 (1991) - [j22]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Some Recent Advances in Network Flows. SIAM Rev. 33(2): 175-219 (1991) - [c3]Murali S. Kodialam, James B. Orlin:
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. SODA 1991: 131-135 - 1990
- [j21]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) - [j20]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)
1980 – 1989
- 1989
- [j19]Randy Shull, James B. Orlin, Alan Shuchat, Marianne L. Gardner:
The structure of bases in bicircular matroids. Discret. Appl. Math. 23(3): 267-283 (1989) - [j18]Ravindra K. Ahuja, James B. Orlin:
A Fast and Simple Algorithm for the Maximum Flow Problem. Oper. Res. 37(5): 748-759 (1989) - [j17]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
- [j16]Thomas L. Magnanti, James B. Orlin:
Parametric linear programming and anti-cycling pivoting rules. Math. Program. 41(1-3): 317-325 (1988) - [c2]James B. Orlin:
A Faster Strongly Polynominal Minimum Cost Flow Algorithm. STOC 1988: 377-387 - 1985
- [j15]Amiya K. Chakravarty, James B. Orlin, Uriel G. Rothblum:
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment. Oper. Res. 33(4): 820-834 (1985) - [j14]James B. Orlin:
Technical Note - Some Very Easy Knapsack/Partition Problems. Oper. Res. 33(5): 1154-1160 (1985) - [j13]Zevi Miller, James B. Orlin:
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. J. Algorithms 6(1): 10-16 (1985) - [j12]James B. Orlin, Uriel G. Rothblum:
Computing optimal scalings by parametric network algorithms. Math. Program. 32(1): 1-10 (1985) - [j11]Robert M. Freund, James B. Orlin:
On the complexity of four polyhedral set containment problems. Math. Program. 33(2): 139-145 (1985) - [j10]Stephen C. Graves, James B. Orlin:
A minimum concave-cost dynamic network flow problem with an application to lot-sizing. Networks 15(1): 59-71 (1985) - 1984
- [j9]James B. Orlin:
Minimum Convex Cost Dynamic Network Flows. Math. Oper. Res. 9(2): 190-207 (1984) - 1983
- [j8]James B. Orlin:
Maximum-throughput dynamic network flows. Math. Program. 27(2): 214-231 (1983) - [j7]James B. Orlin:
Dynamic matchings and quasidynamic fractional matchings. I. Networks 13(4): 551-562 (1983) - [j6]James B. Orlin:
Dynamic matchings and quasidynamic fractional matchings. II. Networks 13(4): 563-580 (1983) - 1982
- [j5]James B. Orlin:
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets. Oper. Res. 30(4): 760-776 (1982) - [j4]James B. Orlin:
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property. Math. Program. 22(1): 231-235 (1982) - 1981
- [j3]Richard M. Karp, James B. Orlin:
Parametric shortest path algorithms with an application to cyclic staffing. Discret. Appl. Math. 3(1): 37-45 (1981) - [c1]James B. Orlin:
The Complexity of Dynamic Languages and Dynamic Optimization Problems. STOC 1981: 218-227 - 1980
- [j2]John J. Bartholdi III, James B. Orlin, H. Donald Ratliff:
Cyclic Scheduling via Integer Programs with Circular Ones. Oper. Res. 28(5): 1074-1085 (1980)
1970 – 1979
- 1978
- [j1]James B. Orlin:
Line-digraphs, arborescences, and theorems of tutte and knuth. J. Comb. Theory B 25(2): 187-198 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
