James B. Orlin

157 papers A* 17A 2B 8C 1Journal 121Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP.
CoRR
Christoph Grüne, Berit Johannes, James B. Orlin, Lasse Wulf
2026 A* conf
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow.
SODA
Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2025 J jnl
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow.
CoRR
Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2025 J jnl
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.
INFORMS J. Optim.
Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
2023 J jnl
Directed Shortest Paths via Approximate Cost Balancing.
J. ACM
James B. Orlin, László A. Végh
2023 J jnl
The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.
CoRR
Nathan Atkinson, Scott C. Ganz, Dorit S. Hochbaum, James B. Orlin
2021 J jnl
A fast maximum flow algorithm.
Networks
James B. Orlin, Xiao-Yue Gong
2021 A* conf
Directed Shortest Paths via Approximate Cost Balancing.
SODA
James B. Orlin, László A. Végh
2021 B conf
Linearizable Special Cases of the Quadratic Shortest Path Problem.
WG
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2020 J jnl
Directed Shortest Paths via Approximate Cost Balancing.
CoRR
James B. Orlin, László A. Végh
2020 — conf
Distributionally Robust Max Flows.
SOSA
Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi
2019 J jnl
A Fast Max Flow Algorithm.
CoRR
James B. Orlin, Xiao-Yue Gong
2018 J jnl
On the complexity of energy storage problems.
Discret. Optim.
Nir Halman, Giacomo Nannicini, James B. Orlin
2018 J jnl
Randomized algorithms for finding the shortest negative cost cycle in networks.
Discret. Appl. Math.
James B. Orlin, K. Subramani, Piotr Wojciechowski
2018 J jnl
Robust monotone submodular function maximization.
Math. Program.
James B. Orlin, Andreas S. Schulz, Rajan Udwani
2018 — ch.
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.
Handbook of Approximation Algorithms and Metaheuristics (1)
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
2017 A* conf
An
SODA
James B. Orlin, Antonio Sedeño-Noda
2016 J jnl
A characterization of irreducible infeasible subsystems in flow networks.
Networks
Imke Joormann, James B. Orlin, Marc E. Pfetsch
2016 J jnl
On the power of randomization in network interdiction.
Oper. Res. Lett.
Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin
2016 B conf
Robust Monotone Submodular Function Maximization.
IPCO
James B. Orlin, Andreas S. Schulz, Rajan Udwani
2015 J jnl
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.
SIAM J. Optim.
Nir Halman, Giacomo Nannicini, James B. Orlin
2015 J jnl
Robust Monotone Submodular Function Maximization.
CoRR
James B. Orlin, Andreas S. Schulz, Rajan Udwani
2014 J jnl
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.
SIAM J. Discret. Math.
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi
2013 A conf
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.
ESA
Nir Halman, Giacomo Nannicini, James B. Orlin
2013 J jnl
Fast algorithms for convex cost flow problems on circles, lines, and trees.
Networks
James B. Orlin, Balachandran Vaidyanathan
2013 A* conf
Max flows in O(nm) time, or better.
STOC
James B. Orlin
2013 J jnl
On the hardness of finding subsets with equal average.
Inf. Process. Lett.
Edith Elkind, James B. Orlin
2013 J jnl
On the power of randomization in network interdiction.
CoRR
Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin
2013 J jnl
Robust optimization with incremental recourse.
CoRR
Ebrahim Nasrabadi, James B. Orlin
2013 J jnl
Simplifications and speedups of the pseudoflow algorithm.
Networks
Dorit S. Hochbaum, James B. Orlin
2012 J jnl
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices.
Oper. Res.
Mehdi Ghiyasvand, James B. Orlin
2012 J jnl
Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle.
Oper. Res.
Nir Halman, James B. Orlin, David Simchi-Levi
2011 J jnl
Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator.
Oper. Res.
Woonghee Tim Huh, Retsef Levi, Paat Rusmevichientong, James B. Orlin
2011 J jnl
Complexity results for equistable graphs and related classes.
Ann. Oper. Res.
Martin Milanic, James B. Orlin, Gábor Rudolf
2011 J jnl
End-to-end restorable oblivious routing of hose model traffic.
IEEE/ACM Trans. Netw.
Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
2010 J jnl
A faster algorithm for the single source shortest path problem with few distinct positive lengths.
J. Discrete Algorithms
James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson
2010 — conf
Improved Algorithms for Computing Fisher's Market Clearing Prices.
Equilibrium Computation
James B. Orlin
2010 A* conf
Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices.
STOC
James B. Orlin
2010 J jnl
Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem.
Discret. Math. Algorithms Appl.
Moshe Dror, James B. Orlin, Michael Zhu
2009 J jnl
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.
Math. Oper. Res.
Nir Halman, Diego Klabjan, Mohamed Mostagir, James B. Orlin, David Simchi-Levi
2009 J jnl
A faster strongly polynomial time algorithm for submodular function minimization.
Math. Program.
James B. Orlin
2009 A* conf
A simple combinatorial algorithm for submodular function minimization.
SODA
Satoru Iwata, James B. Orlin
2009 J jnl
Incremental Network Optimization: Theory and Algorithms.
Oper. Res.
Onur Seref, Ravindra K. Ahuja, James B. Orlin
2009 B conf
Integer Programming: Optimization and Evaluation Are Equivalent.
WADS
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2009 — ch.
Maximum Flow Problem.
Encyclopedia of Optimization
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
2009 — ch.
Minimum Cost Flow Problem.
Encyclopedia of Optimization
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
2009 J jnl
Oblivious routing of highly variable traffic in service overlays and IP backbones.
IEEE/ACM Trans. Netw.
Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
2008 B conf
A Fast, Simpler Algorithm for the Matroid Parity Problem.
IPCO
James B. Orlin
2008 J jnl
A simple method for improving the primal simplex method for the multicommodity flow problem.
Networks
Agustín Bompadre, James B. Orlin
2008 J jnl
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
SIAM J. Discret. Math.
Moshe Dror, James B. Orlin
2008 A* conf
Fully polynomial time approximation schemes for stochastic dynamic programs.
SODA
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi
2008 J jnl
Scale-invariant clustering with minimum volume ellipsoids.
Comput. Oper. Res.
Mahesh Kumar, James B. Orlin
2008 J jnl
Scheduling malleable tasks with interdependent processing rates: Comments and observations.
Discret. Appl. Math.
Edmund K. Burke, Moshe Dror, James B. Orlin
2008 J jnl
The Locomotive Routing Problem.
Transp. Sci.
Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin
2008 J jnl
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discret. Optim.
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
2007 B conf
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.
IPCO
James B. Orlin
2007 J jnl
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.
INFORMS J. Comput.
Ravindra K. Ahuja, Jon Goodstein, Amit Mukherjee, James B. Orlin, Dushyant Sharma
2007 J jnl
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem.
Oper. Res.
Ravindra K. Ahuja, Arvind Kumar, Krishna C. Jha, James B. Orlin
2007 J jnl
Lexicographically Minimum and Maximum Load Linear Programming Problems.
Oper. Res.
Dritan Nace, James B. Orlin
2007 J jnl
Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic.
IEEE J. Sel. Areas Commun.
Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
2007 J jnl
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
INFORMS J. Comput.
Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma
2007 — ch.
Very Large-Scale Neighborhood Search.
Handbook of Approximation Algorithms and Metaheuristics
Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja
2006 A* conf
A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.
INFOCOM
Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
2006 J jnl
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem.
Discret. Optim.
Özlem Ergun, James B. Orlin
2006 J jnl
Creating very large scale neighborhoods out of smaller ones by compounding moves.
J. Heuristics
Özlem Ergun, James B. Orlin, Abran Steele-Feldman
2006 J jnl
Fast neighborhood search for the single machine total weighted tardiness problem.
Oper. Res. Lett.
Özlem Ergun, James B. Orlin
2006 J jnl
Improved bounds for vehicle routing solutions.
Discret. Optim.
Agustín Bompadre, Moshe Dror, James B. Orlin
2006 J jnl
On the Sum-of-Squares algorithm for bin packing.
J. ACM
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
2006 A* conf
Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic.
INFOCOM
Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta
2006 J jnl
The Tsp and the Sum of its Marginal Values.
Int. J. Comput. Geom. Appl.
Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk
2006 C conf
Very Large-Scale Neighborhood Search Techniques in Timetabling Problems.
PATAT
Carol Meyers, James B. Orlin
2005 J jnl
IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson.
Int. Trans. Oper. Res.
Robert G. Bland, James B. Orlin
2005 J jnl
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
Math. Program.
Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti
2005 J jnl
Solving Real-Life Locomotive-Scheduling Problems.
Transp. Sci.
Ravindra K. Ahuja, Jian Liu, James B. Orlin, Dushyant Sharma, Larry A. Shughart
2005 B conf
Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.
IPCO
Agustín Bompadre, James B. Orlin
2004 J jnl
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
2004 J jnl
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Manag. Sci.
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà
2004 J jnl
A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
Networks
Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee
2004 J jnl
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput.
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2004 A* conf
Approximate local search in combinatorial optimization.
SODA
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
2004 J jnl
Extended neighborhood: Definition and characterization.
Math. Program.
James B. Orlin, Dushyant Sharma
2003 J jnl
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett.
Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
2003 J jnl
Dynamic shortest paths minimizing travel times and costs.
Networks
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
2003 J jnl
Solving the Convex Cost Integer Dual Network Flow Problem.
Manag. Sci.
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
2002 J jnl
A network simplex algorithm with O(
Oper. Res. Lett.
Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam
2002 J jnl
A survey of very large-scale neighborhood search techniques.
Discret. Appl. Math.
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
2002 A conf
Branch-and-Bound Algorithms for the Test Cover Problem.
ESA
Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie
2002 J jnl
Combinatorial algorithms for inverse network flow problems.
Networks
Ravindra K. Ahuja, James B. Orlin
2002 J jnl
Faster Parametric Shortest Path and Minimum Balance Algorithms
CoRR
Neal E. Young, Robert Endre Tarjan, James B. Orlin
2002 J jnl
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transp. Sci.
Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
2002 J jnl
On multiroute maximum flows in networks.
Networks
Charu C. Aggarwal, James B. Orlin
2002 J jnl
On the Sum-of-Squares Algorithm for Bin Packing
CoRR
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
2001 J jnl
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.
Oper. Res.
Ravindra K. Ahuja, James B. Orlin
2001 J jnl
Inverse Optimization.
Oper. Res.
Ravindra K. Ahuja, James B. Orlin
2001 J jnl
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem.
Math. Program.
Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
2000 J jnl
A Faster Algorithm for the Inverse Spanning Tree Problem.
J. Algorithms
Ravindra K. Ahuja, James B. Orlin
2000 J jnl
A greedy genetic algorithm for the quadratic assignment problem.
Comput. Oper. Res.
Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
2000 J jnl
New polynomial-time cycle-canceling algorithms for minimum-cost flows.
Networks
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
2000 A* conf
On the sum-of-squares algorithm for bin packing.
STOC
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
2000 J jnl
Optimal Rounding of Instantaneous Fractional Flows Over Time.
SIAM J. Discret. Math.
Lisa Fleischer, James B. Orlin
2000 A* conf
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
STOC
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
1999 — ch.
Networks And Flows.
Handbook of Discrete and Combinatorial Mathematics
James B. Orlin, Ravindra K. Ahuja, David Simchi-Levi, Sunil Chopra, Bruce L. Golden, B. K. Kaku
1999 J jnl
Solving Inverse Spanning Tree Problems Through Network Flow Techniques.
Oper. Res.
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
1999 B conf
Solving the Convex Cost Integer Dual Network Flow Problem.
IPCO
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
1998 J jnl
A Scaling Algorithm for Multicommodity Flow Problems.
Oper. Res.
Rina R. Schneur, James B. Orlin
1998 J jnl
Diagnosing infeasibilities in network flow problems.
Math. Program.
Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin
1997 J jnl
A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines.
Oper. Res.
Paul Mireault, James B. Orlin, Rakesh V. Vohra
1997 J jnl
A polynomial time primal network simplex algorithm for minimum cost flows.
Math. Program.
James B. Orlin
1997 J jnl
Developing Fitter Genetic Algorithms.
INFORMS J. Comput.
Ravindra K. Ahuja, James B. Orlin
1997 J jnl
Equivalence of the primal and dual simplex algorithms for the maximum flow problem.
Oper. Res. Lett.
Ravindra K. Ahuja, James B. Orlin
1997 J jnl
Optimized Crossover for the Independent Set Problem.
Oper. Res.
Charu C. Aggarwal, James B. Orlin, Ray P. Tai
1997 J jnl
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem.
Math. Oper. Res.
Donald Goldfarb, Zhiying Jin, James B. Orlin
1996 A* conf
A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).
SODA
James B. Orlin
1996 J jnl
Commentary - On Experimental Methods for Algorithm Simulation.
INFORMS J. Comput.
James B. Orlin
1996 J jnl
Use of Representative Operation Counts in Computational Testing of Algorithms.
INFORMS J. Comput.
Ravindra K. Ahuja, James B. Orlin
1995 J jnl
A capacity scaling algorithm for the constrained maximum flow problem.
Networks
Ravindra K. Ahuja, James B. Orlin
1994 J jnl
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
J. Algorithms
Jianxiu Hao, James B. Orlin
1994 J jnl
A technique for speeding up the solution of the Lagrangean dual.
Math. Program.
Dimitris Bertsimas, James B. Orlin
1994 J jnl
Improved Algorithms for Bipartite Network Flow.
SIAM J. Comput.
Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan
1993 J jnl
A Faster Strongly Polynomial Minimum Cost Flow Algorithm.
Oper. Res.
James B. Orlin
1993 J jnl
Determination of optimal vertices from feasible solutions in unimodular linear programming.
Math. Program.
Shinji Mizuno, Romesh Saigal, James B. Orlin
1993 J jnl
Finding minimum cost to time ratio cycles with small integral transit times.
Networks
Mark Hartmann, James B. Orlin
1993 — book
Network flows - theory, algorithms and applications.
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
1993 J jnl
Parallel algorithms for the assignment and minimum-cost flow problems.
Oper. Res. Lett.
James B. Orlin, Clifford Stein
1993 J jnl
Polynomial dual network simplex algorithms.
Math. Program.
James B. Orlin, Serge A. Plotkin, Éva Tardos
1993 J jnl
Recognizing Hidden Bicircular Networks.
Discret. Appl. Math.
Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp
1992 A* conf
A Faster Algorithm for Finding the Minimum Cut in a Graph.
SODA
Jianxiu Hao, James B. Orlin
1992 B conf
A Technique for Speeding up the Solution of the Lagrangian Dual.
IPCO
Dimitris Bertsimas, James B. Orlin
1992 J jnl
Finding minimum-cost flows by double scaling.
Math. Program.
Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
1992 J jnl
New scaling algorithms for the assignment and minimum mean cycle problems.
Math. Program.
James B. Orlin, Ravindra K. Ahuja
1992 J jnl
The Scaling Network Simplex Algorithm.
Oper. Res.
Ravindra K. Ahuja, James B. Orlin
1991 J jnl
Faster parametric shortest path and minimum-balance algorithms.
Networks
Neal E. Young, Robert Endre Tarjan, James B. Orlin
1991 A* conf
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming.
SODA
Murali S. Kodialam, James B. Orlin
1991 J jnl
Some Recent Advances in Network Flows.
SIAM Rev.
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
1990 J jnl
Faster Algorithms for the Shortest Path Problem
J. ACM
Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
1990 J jnl
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.
Math. Program.
James B. Orlin, John H. Vande Vate
1989 J jnl
A Fast and Simple Algorithm for the Maximum Flow Problem.
Oper. Res.
Ravindra K. Ahuja, James B. Orlin
1989 J jnl
Improved Time Bounds for the Maximum Flow Problem.
SIAM J. Comput.
Ravindra K. Ahuja, James B. Orlin, Robert Endre Tarjan
1989 J jnl
The structure of bases in bicircular matroids.
Discret. Appl. Math.
Randy Shull, James B. Orlin, Alan Shuchat, Marianne L. Gardner
1988 A* conf
A Faster Strongly Polynominal Minimum Cost Flow Algorithm
STOC
James B. Orlin
1988 J jnl
Parametric linear programming and anti-cycling pivoting rules.
Math. Program.
Thomas L. Magnanti, James B. Orlin
1985 J jnl
A minimum concave-cost dynamic network flow problem with an application to lot-sizing.
Networks
Stephen C. Graves, James B. Orlin
1985 J jnl
Computing optimal scalings by parametric network algorithms.
Math. Program.
James B. Orlin, Uriel G. Rothblum
1985 J jnl
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment.
Oper. Res.
Amiya K. Chakravarty, James B. Orlin, Uriel G. Rothblum
1985 J jnl
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.
J. Algorithms
Zevi Miller, James B. Orlin
1985 J jnl
On the complexity of four polyhedral set containment problems.
Math. Program.
Robert M. Freund, James B. Orlin
1985 J jnl
Technical Note - Some Very Easy Knapsack/Partition Problems.
Oper. Res.
James B. Orlin
1984 J jnl
Minimum Convex Cost Dynamic Network Flows.
Math. Oper. Res.
James B. Orlin
1983 J jnl
Dynamic matchings and quasidynamic fractional matchings. I.
Networks
James B. Orlin
1983 J jnl
Dynamic matchings and quasidynamic fractional matchings. II.
Networks
James B. Orlin
1983 J jnl
Maximum-throughput dynamic network flows.
Math. Program.
James B. Orlin
1982 J jnl
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property.
Math. Program.
James B. Orlin
1982 J jnl
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets.
Oper. Res.
James B. Orlin
1981 J jnl
Parametric shortest path algorithms with an application to cyclic staffing.
Discret. Appl. Math.
Richard M. Karp, James B. Orlin
1981 A* conf
The Complexity of Dynamic Languages and Dynamic Optimization Problems
STOC
James B. Orlin
1980 J jnl
Cyclic Scheduling via Integer Programs with Circular Ones.
Oper. Res.
John J. Bartholdi III, James B. Orlin, H. Donald Ratliff
1978 J jnl
Line-digraphs, arborescences, and theorems of tutte and knuth.
J. Comb. Theory B
James B. Orlin