James B. Orlin

ORCID

Publication Activity (10 Years)

Years Active: 1978-2023
Publications (10 Years): 15

Top Venues

Publications

Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. CoRR (2023)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. J. ACM 70 (1) (2023)
James B. Orlin, Xiao-Yue Gong
A fast maximum flow algorithm. Networks 77 (2) (2021)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. SODA (2021)
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)
Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi
Distributionally Robust Max Flows. SOSA (2020)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. CoRR (2020)
James B. Orlin, Xiao-Yue Gong
A Fast Max Flow Algorithm. CoRR (2019)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust monotone submodular function maximization. Math. Program. 172 (1-2) (2018)
James B. Orlin, K. Subramani, Piotr J. Wojciechowski
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236 (2018)
Nir Halman, Giacomo Nannicini, James B. Orlin
On the complexity of energy storage problems. Discret. Optim. 28 (2018)
James B. Orlin, Antonio Sedeño-Noda
) time algorithm for finding the min length directed cycle in a graph. SODA (2017)
Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin
On the power of randomization in network interdiction. Oper. Res. Lett. 44 (1) (2016)
Imke Joormann, James B. Orlin, Marc E. Pfetsch
A characterization of irreducible infeasible subsystems in flow networks. Networks 68 (2) (2016)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust Monotone Submodular Function Maximization. IPCO (2016)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust Monotone Submodular Function Maximization. CoRR (2015)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. SIAM J. Optim. 25 (1) (2015)
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) (2014)
Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin
On the power of randomization in network interdiction. CoRR (2013)
James B. Orlin
Max flows in O(nm) time, or better. STOC (2013)
Edith Elkind, James B. Orlin
On the hardness of finding subsets with equal average. Inf. Process. Lett. 113 (13) (2013)
James B. Orlin, Balachandran Vaidyanathan
Fast algorithms for convex cost flow problems on circles, lines, and trees. Networks 62 (4) (2013)
Nir Halman, Giacomo Nannicini, James B. Orlin
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. ESA (2013)
Dorit S. Hochbaum, James B. Orlin
Simplifications and speedups of the pseudoflow algorithm. Networks 61 (1) (2013)
Ebrahim Nasrabadi, James B. Orlin
Robust optimization with incremental recourse. CoRR (2013)
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) (2012)
Mehdi Ghiyasvand, James B. Orlin
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices. Oper. Res. 60 (5) (2012)
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) (2011)
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) (2011)
Martin Milanic, James B. Orlin, Gábor Rudolf
Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188 (1) (2011)
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) (2010)
James B. Orlin
Improved Algorithms for Computing Fisher's Market Clearing Prices. Equilibrium Computation (2010)
James B. Orlin
Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. STOC (2010)
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) (2010)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Integer Programming: Optimization and Evaluation Are Equivalent. WADS (2009)
Satoru Iwata, James B. Orlin
A simple combinatorial algorithm for submodular function minimization. SODA (2009)
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) (2009)
James B. Orlin
A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118 (2) (2009)
Onur Seref, Ravindra K. Ahuja, James B. Orlin
Incremental Network Optimization: Theory and Algorithms. Oper. Res. 57 (3) (2009)
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) (2009)
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) (2008)
Agustín Bompadre, James B. Orlin
A simple method for improving the primal simplex method for the multicommodity flow problem. Networks 51 (1) (2008)
James B. Orlin
A Fast, Simpler Algorithm for the Matroid Parity Problem. IPCO (2008)
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi
Fully polynomial time approximation schemes for stochastic dynamic programs. SODA (2008)
Edmund K. Burke, Moshe Dror, James B. Orlin
Scheduling malleable tasks with interdependent processing rates: Comments and observations. Discret. Appl. Math. 156 (5) (2008)
Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin
The Locomotive Routing Problem. Transp. Sci. 42 (4) (2008)
Mahesh Kumar, James B. Orlin
Scale-invariant clustering with minimum volume ellipsoids. Comput. Oper. Res. 35 (4) (2008)
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) (2008)
James B. Orlin
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. IPCO (2007)
Dritan Nace, James B. Orlin
Lexicographically Minimum and Maximum Load Linear Programming Problems. Oper. Res. 55 (1) (2007)
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) (2007)
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) (2007)
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) (2007)
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) (2007)
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) (2006)
Agustín Bompadre, Moshe Dror, James B. Orlin
Improved bounds for vehicle routing solutions. Discret. Optim. 3 (4) (2006)
Ö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) (2006)
Ö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) (2006)
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)
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)
Carol Meyers, James B. Orlin
Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. PATAT (2006)
Özlem Ergun, James B. Orlin
Fast neighborhood search for the single machine total weighted tardiness problem. Oper. Res. Lett. 34 (1) (2006)
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) (2006)
Ravindra K. Ahuja, Jian Liu, James B. Orlin, Dushyant Sharma, Larry A. Shughart
Solving Real-Life Locomotive-Scheduling Problems. Transp. Sci. 39 (4) (2005)
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)
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) (2005)
Robert G. Bland, James B. Orlin
IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson. Int. Trans. Oper. Res. 12 (3) (2005)
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) (2004)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33 (5) (2004)
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) (2004)
James B. Orlin, Dushyant Sharma
Extended neighborhood: Definition and characterization. Math. Program. 101 (3) (2004)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate local search in combinatorial optimization. SODA (2004)
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) (2004)
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
Solving the Convex Cost Integer Dual Network Flow Problem. Manag. Sci. 49 (7) (2003)
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) (2003)
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
Dynamic shortest paths minimizing travel times and costs. Networks 41 (4) (2003)
Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam
) consecutive degenerate pivots. Oper. Res. Lett. 30 (3) (2002)
Neal E. Young, Robert Endre Tarjan, James B. Orlin
Faster Parametric Shortest Path and Minimum Balance Algorithms CoRR (2002)
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) (2002)
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) (2002)
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)
Ravindra K. Ahuja, James B. Orlin
Combinatorial algorithms for inverse network flow problems. Networks 40 (4) (2002)
Charu C. Aggarwal, James B. Orlin
On multiroute maximum flows in networks. Networks 39 (1) (2002)
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 (2002)
Ravindra K. Ahuja, James B. Orlin
Inverse Optimization. Oper. Res. 49 (5) (2001)
Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91 (1) (2001)
Ravindra K. Ahuja, James B. Orlin
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints. Oper. Res. 49 (5) (2001)
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)
Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27 (10) (2000)
Ravindra K. Ahuja, James B. Orlin
A Faster Algorithm for the Inverse Spanning Tree Problem. J. Algorithms 34 (1) (2000)
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
New polynomial-time cycle-canceling algorithms for minimum-cost flows. Networks 36 (1) (2000)
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). STOC (2000)
Lisa Fleischer, James B. Orlin
Optimal Rounding of Instantaneous Fractional Flows Over Time. SIAM J. Discret. Math. 13 (2) (2000)
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
Solving the Convex Cost Integer Dual Network Flow Problem. IPCO (1999)
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
Solving Inverse Spanning Tree Problems Through Network Flow Techniques. Oper. Res. 47 (2) (1999)
Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin
Diagnosing infeasibilities in network flow problems. Math. Program. 81 (1998)
Rina R. Schneur, James B. Orlin
A Scaling Algorithm for Multicommodity Flow Problems. Oper. Res. 46 (2) (1998)
Ravindra K. Ahuja, James B. Orlin
Equivalence of the primal and dual simplex algorithms for the maximum flow problem. Oper. Res. Lett. 20 (3) (1997)
Ravindra K. Ahuja, James B. Orlin
Developing Fitter Genetic Algorithms. INFORMS J. Comput. 9 (3) (1997)
James B. Orlin
A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 77 (1997)

James B. Orlin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

James B. Orlin