James B. Orlin

26 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-7488-094X

Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

Publications

• Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle — Operations Research 2012
• A Simple Approximation Algorithm for Computing Arrow-Debreu Prices — Operations Research 2012
• Incremental Network Optimization: Theory and Algorithms — Operations Research 2009
• Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem — INFORMS Journal on Computing 2007
• Greedoid-Based Noncompensatory Inference — Marketing Science 2007
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem — Operations Research 2007
• A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model — INFORMS Journal on Computing 2007
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem — Management Science 2004
• Solving the Convex Cost Integer Dual Network Flow Problem — Management Science 2003
• A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints — Operations Research 2001
• Inverse Optimization — Operations Research 2001
• Solving Inverse Spanning Tree Problems Through Network Flow Techniques — Operations Research 1999
• Algorithms for the Simple Equal Flow Problem — Management Science 1999
• A Scaling Algorithm for Multicommodity Flow Problems — Operations Research 1998
• Commentary—Developing Fitter Genetic Algorithms — INFORMS Journal on Computing 1997
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines — Operations Research 1997
• Optimized Crossover for the Independent Set Problem — Operations Research 1997
• Commentary—On Experimental Methods for Algorithm Simulation — INFORMS Journal on Computing 1996
• Use of Representative Operation Counts in Computational Testing of Algorithms — INFORMS Journal on Computing 1996
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm — Operations Research 1993
• A Fast and Simple Algorithm for the Maximum Flow Problem — Operations Research 1989
• Technical Note—Some Very Easy Knapsack/Partition Problems — Operations Research 1985
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment — Operations Research 1985
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment — Operations Research 1982
• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets — Operations Research 1982
• Cyclic Scheduling via Integer Programs with Circular Ones — Operations Research 1980