James B. Orlin

Massachusetts Institute of Technology (MIT) - Sloan School of Management

Professor of Management Science andOperations Research

E53-357

Cambridge, MA 02142

United States

SCHOLARLY PAPERS

18

DOWNLOADS
Rank 8,834

SSRN RANKINGS

Top 8,834

in Total Papers Downloads

4,252

CITATIONS
Rank 23,011

SSRN RANKINGS

Top 23,011

in Total Papers Citations

12

Scholarly Papers (18)

1.

Exact and Heuristic Methods for the Weapon Target Assignment Problem

MIT Sloan Working Paper No. 4464-03
Number of pages: 21 Posted: 20 Apr 2004
University of Florida - Department of Industrial and Systems Engineering, University of Florida - Department of Industrial and Systems Engineering, University of Florida - Department of Industrial and Systems Engineering and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 516 (38,579)

Abstract:

Weapon Target Assignment, WTA, very large-scale neighborhood search algorithm

2.

Dynamic Shortest Paths Minimizing Travel Times and Costs

MIT Sloan Working Paper No. 4390-02
Number of pages: 16 Posted: 26 Oct 2002
University of Florida - Department of Industrial and Systems Engineering, Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Pisa - Department of Information Science and University of Pisa - Department of Information Science
Downloads 421 (52,919)

Abstract:

Node, Minimum Cost Walk Problem, Polynomially, FIFO Networks, NP-hard Problem

Approximate Local Search in Combinatorial Optimization

MIT Sloan Working Paper No. 4325-03
Number of pages: 15 Posted: 16 Jul 2003
James B. Orlin, Abraham P. Punnen and Andreas S. Schulz
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of New Brunswick - Department of Mathematical Sciences and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 395 (59,460)
Citation 1

Abstract:

Local Search, Neighborhood Search, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, 0/1-Integer Programming

Approximate Local Search in Combinatorial Optimization

SIAM Journal on Computing, Vol. 33, No. 5, pp. 1201-1214, 2004
Posted: 29 Jul 2007
James B. Orlin, Abraham P. Punnen and Andreas S. Schulz
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of New Brunswick - Department of Mathematical Sciences and Massachusetts Institute of Technology (MIT) - Sloan School of Management

Abstract:

Local Search, Neighborhood Search, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, 0/1-Integer Programming

4.

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs

MIT Sloan Working Paper No. 4465-03
Number of pages: 17 Posted: 22 Jan 2004
Infosys Technologies Limited, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Integrated Decision Systems Consultancy
Downloads 351 (67,000)

Abstract:

sensitivity analysis, shortest path problem, bottleneck shortest path, maximum capacity path problem

5.

Solving Real-Life Locomotive Scheduling Problems

MIT Sloan Working Paper No. 4389-02
Number of pages: 35 Posted: 02 Nov 2002
University of Florida - Department of Industrial and Systems Engineering, University of Florida - Warrington College of Business Administration, Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Michigan at Ann Arbor - Department of Industrial and Operations Engineering and CSX Transportation
Downloads 340 (65,469)
Citation 1

Abstract:

Locomotive, Mixed Interger Programming, MIP

6.

A Multi-Exchange Heuristic for the Single Source Capacitated Facility Location Problem

MIT Sloan Working Paper No. 4387-02
Number of pages: 32 Posted: 01 Nov 2002
University of Florida - Department of Industrial and Systems Engineering, Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Pisa - Department of Information Science, University of Pisa - Department of Information Science and University of Pisa - Department of Information Science
Downloads 266 (90,875)
Citation 2

Abstract:

Location Problems, Large Scale Optimization, Multi-exchange

7.

Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem

MIT Sloan Working Paper No. 4463-03
Number of pages: 25 Posted: 07 Apr 2004
Ozlem Ergun and James B. Orlin
Georgia Institute of Technology - The H. Milton Stewart School of Industrial & Systems Engineering (ISyE) and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 248 (100,138)

Abstract:

dynamic programming, neighborhood construction techniques,

8.

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model

MIT Sloan Working Paper No. 4388-01
Number of pages: 33 Posted: 02 Nov 2002
University of Florida - Department of Industrial and Systems Engineering, United Airlines World Headquarters-WHQKB - Information Services Division, United Airlines World Headquarters-WHQKB - Information Services Division, Massachusetts Institute of Technology (MIT) - Sloan School of Management and University of Michigan at Ann Arbor - Department of Industrial and Operations Engineering
Downloads 241 (101,881)
Citation 2

Abstract:

Fleet Assignment Model, FAM, TAM, Very Large-Scale Neighborhood, VLSN

9.

Greedoid-Based Noncompensatory Inference

MIT Sloan Research Paper No. 4583-05, Journal of Marketing Science, Forthcoming
Number of pages: 39 Posted: 16 Feb 2006
Michael Yee, Ely Dahan, John R. Hauser and James B. Orlin
Massachusetts Institute of Technology (MIT) - Operations Research Center, University of California, Los Angeles (UCLA) - Department of Urology, MIT Sloan School of Management and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 195 (124,980)
Citation 4

Abstract:

Lexicography, Noncompensatory decision rules, Choice heuristics, Optimization methods in marketing, Conjoint analysis, Product development, Consideration sets.

10.

Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem

MIT Sloan Working Paper No. 4393-02
Number of pages: 39 Posted: 07 Jan 2003
Ozlem Ergun, James B. Orlin and Abran Steele-Feldman
Georgia Institute of Technology - The H. Milton Stewart School of Industrial & Systems Engineering (ISyE), Massachusetts Institute of Technology (MIT) - Sloan School of Management and Independent
Downloads 184 (129,193)

Abstract:

Large Scale Neighborhoods, Routing, VLSN, CIM

11.

A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand

MIT Sloan Research Paper No. 4582-06
Number of pages: 18 Posted: 16 Feb 2006
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Illinois at Urbana-Champaign, University of Illinois at Urbana-Champaign - Department of Mechanical and Industrial Engineering, University of Michigan, Stephen M. Ross School of Business and Massachusetts Institute of Technology (MIT) - School of Engineering
Downloads 169 (142,768)

Abstract:

Inventory Replenishment Policy

12.

Extended Neighborhood: Definition and Characterization

MIT Sloan Working Paper No. 4392-02
Number of pages: 28 Posted: 12 Nov 2002
James B. Orlin and Dushyant Sharma
Massachusetts Institute of Technology (MIT) - Sloan School of Management and University of Michigan at Ann Arbor - Department of Industrial and Operations Engineering
Downloads 160 (148,859)

Abstract:

Neighborhood Structure

13.

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

MIT Sloan School of Management Working Paper No. 4386-02
Number of pages: 28 Posted: 03 Nov 2002
University of Florida - Department of Industrial and Systems Engineering, University of Florida - Department of Industrial and Systems Engineering, Massachusetts Institute of Technology (MIT) - Sloan School of Management and University of Michigan at Ann Arbor - Department of Industrial and Operations Engineering
Downloads 147 (161,548)

Abstract:

Quadratic Assignment Problem, QAP, Very Large-Scale Neighborhood, VLSN

14.

Lexicographically Minimum and Maximum Load Linear Programming Problems

MIT Sloan Research Paper No. 4584-05, Annals of Operations Research, Forthcoming
Number of pages: 12 Posted: 16 Feb 2006
Dritan Nace and James B. Orlin
University of Technology of Compiegne and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 139 (166,251)

Abstract:

Equitable Distribution

15.

A Scale Invariant Clustering using Minimum Volume Ellipsoids

MIT Sloan Research Paper No. 4586-06
Number of pages: 9 Posted: 16 Feb 2006
Mahesh Kumar and James B. Orlin
Rutgers, The State University of New Jersey - Rutgers Business School at Newark & New Brunswick and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 109 (195,416)

Abstract:

16.

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model

MIT Sloan Research Paper No. 4580-05
Number of pages: 27 Posted: 24 Feb 2006
University of Florida - Department of Industrial and Systems Engineering, United Airlines World Headquarters-WHQKB - Information Services Division, United Airlines World Headquarters-WHQKB - Information Services Division, Massachusetts Institute of Technology (MIT) - Sloan School of Management and University of Michigan at Ann Arbor - Department of Industrial and Operations Engineering
Downloads 101 (205,711)
Citation 2

Abstract:

transportation, air, heuristics, integer programming, neighborhood search, networks

17.

On the Sum-of-Squares Algorithm for Bin Packing

MIT Sloan Research Paper No. 4581-06, Journal of the Association of Computing Machinery, Forthcoming
Number of pages: 68 Posted: 16 Feb 2006
University of Szeged, AT&T - AT&T Laboratories, Massachusetts Institute of Technology (MIT) - Sloan School of Management, Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of Cambridge and Brown University
Downloads 91 (230,943)

Abstract:

Algorithms, Experimentation, Theory, Approximation Algorithms, Average Case Analysis, Bin Packing

18.

A Scaling Algorithm for Multicommodity Flow Problems

Posted: 25 Aug 1998
Rina R. Schneur and James B. Orlin
PTCG, Inc. and Massachusetts Institute of Technology (MIT) - Sloan School of Management

Abstract: