James B. Orlin

According to our database1, James B. Orlin authored at least 136 papers between 1978 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Directed Shortest Paths via Approximate Cost Balancing.
CoRR, 2020

Distributionally Robust Max Flows.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

A Fast Max Flow Algorithm.
CoRR, 2019

Robust monotone submodular function maximization.
Math. Program., 2018

On the complexity of energy storage problems.
Discret. Optim., 2018

Randomized algorithms for finding the shortest negative cost cycle in networks.
Discret. Appl. Math., 2018

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On the power of randomization in network interdiction.
Oper. Res. Lett., 2016

A characterization of irreducible infeasible subsystems in flow networks.
Networks, 2016

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.
SIAM J. Optim., 2015

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.
SIAM J. Discret. Math., 2014

Fast algorithms for convex cost flow problems on circles, lines, and trees.
Networks, 2013

Simplifications and speedups of the pseudoflow algorithm.
Networks, 2013

On the hardness of finding subsets with equal average.
Inf. Process. Lett., 2013

Robust optimization with incremental recourse.
CoRR, 2013

Max flows in O(nm) time, or better.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle.
Oper. Res., 2012

A Simple Approximation Algorithm for Computing Arrow-Debreu Prices.
Oper. Res., 2012

End-to-end restorable oblivious routing of hose model traffic.
IEEE/ACM Trans. Netw., 2011

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator.
Oper. Res., 2011

Complexity results for equistable graphs and related classes.
Ann. Oper. Res., 2011

A faster algorithm for the single source shortest path problem with few distinct positive lengths.
J. Discrete Algorithms, 2010

Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem.
Discret. Math. Algorithms Appl., 2010

Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Improved Algorithms for Computing Fisher's Market Clearing Prices.
Proceedings of the Equilibrium Computation, 25.04. - 30.04.2010, 2010

Minimum Cost Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Flow Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Oblivious routing of highly variable traffic in service overlays and IP backbones.
IEEE/ACM Trans. Netw., 2009

A faster strongly polynomial time algorithm for submodular function minimization.
Math. Program., 2009

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.
Math. Oper. Res., 2009

Incremental Network Optimization: Theory and Algorithms.
Oper. Res., 2009

Integer Programming: Optimization and Evaluation Are Equivalent.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

A simple combinatorial algorithm for submodular function minimization.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

The Locomotive Routing Problem.
Transp. Sci., 2008

Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
SIAM J. Discret. Math., 2008

A simple method for improving the primal simplex method for the multicommodity flow problem.
Networks, 2008

epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discret. Optim., 2008

Scheduling malleable tasks with interdependent processing rates: Comments and observations.
Discret. Appl. Math., 2008

Scale-invariant clustering with minimum volume ellipsoids.
Comput. Oper. Res., 2008

A Fast, Simpler Algorithm for the Matroid Parity Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Very Large-Scale Neighborhood Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic.
IEEE J. Sel. Areas Commun., 2007

Lexicographically Minimum and Maximum Load Linear Programming Problems.
Oper. Res., 2007

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem.
Oper. Res., 2007

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.
INFORMS J. Comput., 2007

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.
INFORMS J. Comput., 2007

Fast neighborhood search for the single machine total weighted tardiness problem.
Oper. Res. Lett., 2006

On the Sum-of-Squares algorithm for bin packing.
J. ACM, 2006

The Tsp and the Sum of its Marginal Values.
Int. J. Comput. Geom. Appl., 2006

Creating very large scale neighborhoods out of smaller ones by compounding moves.
J. Heuristics, 2006

A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem.
Discret. Optim., 2006

Improved bounds for vehicle routing solutions.
Discret. Optim., 2006

Very Large-Scale Neighborhood Search Techniques in Timetabling Problems.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Solving Real-Life Locomotive-Scheduling Problems.
Transp. Sci., 2005

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.
Math. Program., 2005

IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson.
Int. Trans. Oper. Res., 2005

Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput., 2004

A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
Networks, 2004

Extended neighborhood: Definition and characterization.
Math. Program., 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Manag. Sci., 2004

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica, 2004

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.
Networks, 2003

Solving the Convex Cost Integer Dual Network Flow Problem.
Manag. Sci., 2003

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transp. Sci., 2002

A network simplex algorithm with O(<i>n</i>) consecutive degenerate pivots.
Oper. Res. Lett., 2002

Combinatorial algorithms for inverse network flow problems.
Networks, 2002

On multiroute maximum flows in networks.
Networks, 2002

A survey of very large-scale neighborhood search techniques.
Discret. Appl. Math., 2002

Branch-and-Bound Algorithms for the Test Cover Problem.
Proceedings of the Algorithms, 2002

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem.
Math. Program., 2001

A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.
Oper. Res., 2001

Inverse Optimization.
Oper. Res., 2001

Optimal Rounding of Instantaneous Fractional Flows Over Time.
SIAM J. Discret. Math., 2000

New polynomial-time cycle-canceling algorithms for minimum-cost flows.
Networks, 2000

A Faster Algorithm for the Inverse Spanning Tree Problem.
J. Algorithms, 2000

A greedy genetic algorithm for the quadratic assignment problem.
Comput. Oper. Res., 2000

epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Networks And Flows.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Solving Inverse Spanning Tree Problems Through Network Flow Techniques.
Oper. Res., 1999

Diagnosing infeasibilities in network flow problems.
Math. Program., 1998

A Scaling Algorithm for Multicommodity Flow Problems.
Oper. Res., 1998

Equivalence of the primal and dual simplex algorithms for the maximum flow problem.
Oper. Res. Lett., 1997

A polynomial time primal network simplex algorithm for minimum cost flows.
Math. Program., 1997

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem.
Math. Oper. Res., 1997

A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines.
Oper. Res., 1997

Optimized Crossover for the Independent Set Problem.
Oper. Res., 1997

Developing Fitter Genetic Algorithms.
INFORMS J. Comput., 1997

Commentary - On Experimental Methods for Algorithm Simulation.
INFORMS J. Comput., 1996

Use of Representative Operation Counts in Computational Testing of Algorithms.
INFORMS J. Comput., 1996

A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A capacity scaling algorithm for the constrained maximum flow problem.
Networks, 1995

Improved Algorithms for Bipartite Network Flow.
SIAM J. Comput., 1994

A technique for speeding up the solution of the Lagrangean dual.
Math. Program., 1994

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
J. Algorithms, 1994

Parallel algorithms for the assignment and minimum-cost flow problems.
Oper. Res. Lett., 1993

Finding minimum cost to time ratio cycles with small integral transit times.
Networks, 1993

Polynomial dual network simplex algorithms.
Math. Program., 1993

Determination of optimal vertices from feasible solutions in unimodular linear programming.
Math. Program., 1993

A Faster Strongly Polynomial Minimum Cost Flow Algorithm.
Oper. Res., 1993

Recognizing Hidden Bicircular Networks.
Discret. Appl. Math., 1993

Network flows - theory, algorithms and applications.
Prentice Hall, ISBN: 978-0-13-617549-0, 1993

New scaling algorithms for the assignment and minimum mean cycle problems.
Math. Program., 1992

Finding minimum-cost flows by double scaling.
Math. Program., 1992

The Scaling Network Simplex Algorithm.
Oper. Res., 1992

A Faster Algorithm for Finding the Minimum Cut in a Graph.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

A Technique for Speeding up the Solution of the Lagrangian Dual.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Some Recent Advances in Network Flows.
SIAM Rev., 1991

Faster parametric shortest path and minimum-balance algorithms.
Networks, 1991

Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Faster Algorithms for the Shortest Path Problem
J. ACM, April, 1990

Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.
Math. Program., 1990

Improved Time Bounds for the Maximum Flow Problem.
SIAM J. Comput., 1989

A Fast and Simple Algorithm for the Maximum Flow Problem.
Oper. Res., 1989

The structure of bases in bicircular matroids.
Discret. Appl. Math., 1989

Parametric linear programming and anti-cycling pivoting rules.
Math. Program., 1988

A Faster Strongly Polynominal Minimum Cost Flow Algorithm
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

A minimum concave-cost dynamic network flow problem with an application to lot-sizing.
Networks, 1985

Computing optimal scalings by parametric network algorithms.
Math. Program., 1985

On the complexity of four polyhedral set containment problems.
Math. Program., 1985

NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.
J. Algorithms, 1985

Technical Note - Some Very Easy Knapsack/Partition Problems.
Oper. Res., 1985

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment.
Oper. Res., 1985

Minimum Convex Cost Dynamic Network Flows.
Math. Oper. Res., 1984

Dynamic matchings and quasidynamic fractional matchings. II.
Networks, 1983

Dynamic matchings and quasidynamic fractional matchings. I.
Networks, 1983

Maximum-throughput dynamic network flows.
Math. Program., 1983

A polynomial algorithm for integer programming covering problems satisfying the integer round-up property.
Math. Program., 1982

Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets.
Oper. Res., 1982

Parametric shortest path algorithms with an application to cyclic staffing.
Discret. Appl. Math., 1981

The Complexity of Dynamic Languages and Dynamic Optimization Problems
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Cyclic Scheduling via Integer Programs with Circular Ones.
Oper. Res., 1980

Line-digraphs, arborescences, and theorems of tutte and knuth.
J. Comb. Theory, Ser. B, 1978