James B. Orlin
#34,247
Most Influential Person Now
American researcher
James B. Orlin's AcademicInfluence.com Rankings
James B. Orlinmathematics Degrees
Mathematics
#2629
World Rank
#4024
Historical Rank
#1026
USA Rank
Operations Research
#17
World Rank
#17
Historical Rank
#11
USA Rank
Measure Theory
#984
World Rank
#1278
Historical Rank
#367
USA Rank
Download Badge
Mathematics
James B. Orlin's Degrees
- PhD Operations Research Stanford University
- Masters Statistics Stanford University
Why Is James B. Orlin Influential?
(Suggest an Edit or Addition)According to Wikipedia, James Berger Orlin is an American operations researcher, the Edward Pennell Brooks Professor in Management and Professor of Operations Research at the MIT Sloan School of Management. Biography Orlin did his undergraduate studies at the University of Pennsylvania, receiving a bachelor's degree in mathematics in 1974. In 1976, he earned two master's degrees, an MSc from California Institute of Technology and an MMath from University of Waterloo. Orlin received his Ph.D. in operations research from Stanford University in 1981 under the supervision of Arthur Fales Veinott Jr. He joined the MIT faculty as an assistant professor in 1979, and became the Brooks Professor in 1998.
James B. Orlin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Network flows - theory, algorithms and applications (1993) (7664)
- Network Flows (2011) (1116)
- An STS-Based Map of the Human Genome (1995) (818)
- A survey of very large-scale neighborhood search techniques (2002) (694)
- A faster strongly polynomial minimum cost flow algorithm (1993) (685)
- Faster algorithms for the shortest path problem (1990) (553)
- Inverse Optimization (2001) (450)
- Max flows in O(nm) time, or better (2013) (392)
- A greedy genetic algorithm for the quadratic assignment problem (2000) (390)
- Single transferable vote resists strategic voting (2015) (359)
- A faster strongly polynomial time algorithm for submodular function minimization (2007) (303)
- Contentment in graph theory: Covering graphs with cliques (1977) (295)
- A polynomial time primal network simplex algorithm for minimum cost flows (1996) (248)
- Handbook of Approximation Algorithms and Metaheuristics (2007) (246)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (1994) (233)
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem (2007) (210)
- Cyclic Scheduling via Integer Programs with Circular Ones (1980) (182)
- Faster parametric shortest path and minimum-balance algorithms (1991) (180)
- Improved Algorithms for Bipartite Network Flow (1994) (166)
- Greedoid-Based Noncompensatory Inference (2007) (163)
- A Fast and Simple Algorithm for the Maximum Flow Problem (2011) (153)
- Beyond conjoint analysis: Advances in preference measurement (2008) (151)
- A faster algorithm for finding the minimum cut in a graph (1992) (151)
- Improved Time Bounds for the Maximum Flow Problem (2018) (148)
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem (2001) (143)
- Parametric shortest path algorithms with an application to cyclic staffing (1981) (139)
- A simple combinatorial algorithm for submodular function minimization (2009) (137)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (2004) (131)
- Finding minimum-cost flows by double scaling (2015) (128)
- Optimized Crossover for the Independent Set Problem (1997) (128)
- Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator (2011) (128)
- Solving Real-Life Locomotive-Scheduling Problems (2005) (125)
- Dynamic shortest paths minimizing travel times and costs (2001) (116)
- Solving the Convex Cost Integer Dual Network Flow Problem (1999) (116)
- New scaling algorithms for the assignment and minimum mean cycle problems (1992) (105)
- Approximate local search in combinatorial optimization (2004) (100)
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment (1982) (98)
- Theory of cyclic transfers (1989) (98)
- Computational investigations of maximum flow algorithms (1997) (92)
- Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices (2010) (92)
- On the complexity of four polyhedral set containment problems (2018) (86)
- Very Large-Scale Neighborhood Search (2000) (82)
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints (2001) (77)
- Combinatorial algorithms for inverse network flow problems (2002) (77)
- On the simplex algorithm for networks and generalized networks (1983) (77)
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem (2003) (77)
- Minimum Convex Cost Dynamic Network Flows (1984) (76)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (2010) (75)
- Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones (2009) (74)
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques (1999) (71)
- Genuinely Polynomial Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem (2015) (71)
- Exact and Heuristic Methods for the Weapon Target Assignment Problem (2003) (70)
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand (2009) (70)
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment (1985) (63)
- A Faster Algorithm for the Inverse Spanning Tree Problem (2000) (63)
- Fully polynomial time approximation schemes for stochastic dynamic programs (2008) (61)
- Finding minimum cost to time ratio cycles with small integral transit times (1993) (59)
- The Locomotive Routing Problem (2008) (59)
- Robust monotone submodular function maximization (2015) (58)
- On multiroute maximum flows in networks (2002) (57)
- On the Sum-of-Squares algorithm for bin packing (2002) (57)
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (1997) (56)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (2006) (55)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (1981) (55)
- Some problems on dynamic/periodic graphs (1983) (55)
- New scaling algorithms for the assignment and minimum cycle mean problems (1988) (55)
- Some Recent Advances in Network Flows (1991) (53)
- Polynomial dual network simplex algorithms (2011) (50)
- Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets (1982) (48)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (2006) (48)
- Very Large-Scale Neighborhood Search Techniques in Timetabling Problems (2006) (47)
- Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems (1991) (45)
- Use of Representative Operation Counts in Computational Testing of Algorithms (1996) (45)
- Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic (2006) (45)
- A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem (2004) (44)
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines (1997) (44)
- On the power of randomization in network interdiction (2013) (44)
- A capacity scaling algorithm for the constrained maximum flow problem (1995) (43)
- A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model (2007) (43)
- The complexity of dynamic languages and dynamic optimization problems (1981) (42)
- Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem (2002) (42)
- Improved bounds for vehicle routing solutions (2006) (42)
- Algorithms for the Simple Equal Flow Problem (1999) (41)
- The Minimal Integral Separator of A Threshold Graph (1977) (41)
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (2002) (40)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (2005) (40)
- Chapter IV Network flows (1989) (39)
- The Scaling Network Simplex Algorithm (1992) (39)
- QuickMatch--a very fast algorithm for the assignment problem (1993) (37)
- Maximum-throughput dynamic network flows (1983) (36)
- New neighborhood search structures for the capacitated minimum spanning tree problem (1998) (36)
- Line-digraphs, arborescences, and theorems of tutte and knuth (1978) (35)
- Parametric linear programming and anti-cycling pivoting rules (1988) (34)
- Chapter 1 Applications of network optimization (1995) (33)
- Fast neighborhood search for the single machine total weighted tardiness problem (2006) (33)
- Lexicographically Minimum and Maximum Load Linear Programming Problems (2007) (33)
- Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem (2002) (32)
- Branch-and-Bound Algorithms for the Test Cover Problem (2002) (31)
- New polynomial-time cycle-canceling algorithms for minimum cost flows (2000) (30)
- A Fast, Simpler Algorithm for the Matroid Parity Problem (2008) (29)
- Inverse Optimization, Part I: Linear Programming and General Problem (1998) (29)
- Incremental Network Optimization: Theory and Algorithms (2009) (28)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (1990) (27)
- Developing Fitter Genetic Algorithms (1997) (25)
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing (1985) (25)
- Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle (2012) (25)
- NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings (1985) (25)
- A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones (2006) (24)
- New polynomial-time cycle-canceling algorithms for minimum-cost flows (2000) (24)
- On the sum-of-squares algorithm for bin packing (2000) (23)
- A Scaling Algorithm for Multicommodity Flow Problems (2018) (22)
- Robust optimization with incremental recourse (2013) (22)
- Robust monotone submodular function maximization (2015) (21)
- Analysis and solution algorithms of sealift routing and scheduling problems : final report (1985) (21)
- New neighborhood search algorithms based on exponentially large neighborhoods (2001) (21)
- Simplifications and speedups of the pseudoflow algorithm (2012) (21)
- A neighborhood search algorithm for the combined through and fleet assignment model with time windows (2004) (20)
- A network simplex algorithm with O(n) consecutive degenerate pivots (2002) (20)
- Diagnosing infeasibilities in network flow problems (1998) (19)
- Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meier Estimator (2008) (19)
- Complexity results for equistable graphs and related classes (2011) (18)
- Scaling algorithms for multicommodity flow problems and network flow problems with side constraints (1991) (18)
- An O(nm) time algorithm for finding the min length directed cycle in a graph (2016) (18)
- A technique for speeding up the solution of the Lagrangean dual (1994) (17)
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (2013) (17)
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (2008) (17)
- Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems (1995) (16)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (2007) (16)
- On the complexity of energy storage problems (2017) (16)
- Computing optimal scalings by parametric network algorithms (1985) (16)
- A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand (2006) (15)
- New distance-directed algorithms for maximum flow and parametric maximum flow problems (1987) (15)
- Scale-invariant clustering with minimum volume ellipsoids (2008) (14)
- Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming (1991) (14)
- Parallel algorithms for the assignment and minimum-cost flow problems (1993) (14)
- On very large scale assignment problems (1994) (13)
- A dual version of tardos's algorithm for linear programming (1986) (12)
- Solving Multi-Criteria Through-Fleet Assignment Models (2003) (12)
- “ MUST HAVE ” ASPECTS VS . TRADEOFF ASPECTS IN MODELS OF CUSTOMER DECISIONS (2006) (12)
- Maximum Flow Problem (2009) (12)
- Very Large-Scale Neighborhood Search in Airline Fleet Scheduling (2002) (11)
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems (2005) (10)
- Extended neighborhood: Definition and characterization (2004) (10)
- A Simple Approximation Algorithm for Computing Arrow-Debreu Prices (2012) (10)
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (1982) (10)
- The structure of bases in bicircular matroids (1989) (9)
- Scheduling malleable tasks with interdependent processing rates: Comments and observations (2008) (8)
- Randomized algorithms for finding the shortest negative cost cycle in networks (2018) (8)
- Solving Parallel Machine Scheduling Problems with Variable Depth Local Search (2004) (7)
- Optimal Rounding of Instantaneous Fractional Flows Over Time (2000) (7)
- Commentary - On Experimental Methods for Algorithm Simulation (1996) (7)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (2013) (6)
- The complexity of dynamic/periodic languages and optimization problems (1985) (6)
- algorithm for minimum cost flows (1997) (6)
- Integer Programming: Optimization and Evaluation Are Equivalent (2009) (6)
- End-to-End Restorable Oblivious Routing of Hose Model Traffic (2011) (6)
- Minimum Cost Flow Problem (2009) (5)
- A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem (1998) (5)
- A simple method for improving the primal simplex method for the multicommodity flow problem (2008) (5)
- Dynamic matchings and quasidynamic fractional matchings. I (1983) (4)
- IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson (2005) (4)
- Different inducibility and possible significance of several concomitant “fragile sites” in two brothers (1986) (4)
- Recognizing Hidden Bicircular Networks (1993) (4)
- A Scale Invariant Clustering Using Minimum Volume Ellipsoids (2006) (4)
- Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems (2011) (4)
- Computational analysis of network optimization algorithms (1993) (4)
- ε-optimization schemes and L-bit precision (extended abstract): alternative perspectives in combinatorial optimization (2000) (4)
- The Infinite-Horizon Dynamic Lot-Size Problem with Cyclic Demand and Costs (1980) (4)
- Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications (2018) (4)
- Fast Infeasibility Detection Algorithms for Dial-A-Ride Transit Problems (1998) (3)
- A Fast Max Flow Algorithm (2019) (3)
- Technical Note - Some Very Easy Knapsack/Partition Problems (1985) (3)
- epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract) (2000) (3)
- Distributionally Robust Max Flows (2020) (3)
- Solving the Convex Ordered Set Problem with Applications to Isotone Regression (3)
- Two Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem (2003) (3)
- Dynamic matchings and quasidynamic fractional matchings. II (1983) (3)
- Fast Algorithms for Convex Cost Flow Problems on Circles and Trees (2013) (3)
- A finitely converging cutting plane technique (1985) (3)
- Networks And Flows (1999) (3)
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem (1997) (3)
- 15.053 Optimization Methods in Management Science, Spring 2007 (2007) (2)
- Solving the convex ordered set problem (1997) (2)
- A characterization of irreducible infeasible subsystems in flow networks (2016) (2)
- Sloan School of Management Working Paper 4389-02 April 2002 SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS (2002) (1)
- Optimal Rounding of Fractional Dynamic Flows when Transit Times are Zero (1997) (1)
- Linearizable Special Cases of the Quadratic Shortest Path Problem (2021) (1)
- Inverse Spanning Tree Problems: Formulations and Algorithms (2011) (1)
- A Fast Algorithm for Searching Insertion , Swap , and Twist Neighborhoods for the Single Machine Total Weighted Tardiness Problem (2004) (1)
- A fast maximum flow algorithm (2020) (1)
- On Matching Robustness (2007) (1)
- Circular Ones and Cyclic Staffing. (1977) (1)
- The Metric TSP and the Sum of its Marginal Values (2004) (1)
- Electronic Companion— " Adaptive Data-driven Inventory Control with Censored Demand Based On (2010) (1)
- Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem (2010) (1)
- Directed Shortest Paths via Approximate Cost Balancing (2020) (1)
- CONSECUTIVE OPTIMIZORS FOR A PARTITIONING (1)
- Beyond Conjoint Analysis : Advances in Preference Measurement 1 (2007) (1)
- The origin-destination shortest path problem (1993) (1)
- 15.053 Introduction to Optimization, Spring 2002 (2002) (0)
- ε-OPTIMIZATION SCHEMES AND L-BIT PRECISION: ALTERNATIVE PERSPECTIVES FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS (2004) (0)
- PROBABILISTIC ANALYSIS OF UNIT DEMAND (2006) (0)
- Distributionally Robust Max Flow (2018) (0)
- SHORTEST PATH ALGORITHMS WITH AN APPLICATION TO CYCLIC STAFFING by (0)
- The Tsp and the Sum of its Marginal Values (2006) (0)
- 4463-03 July 2003 Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem (2003) (0)
- A polynomial time primal network simplex , USA anston , algorithm for minimum cost flows (0)
- Analysis of Path-Based Approaches to Genomic Physical Mapping (2011) (0)
- A Parametric Worst Case Analysis for a Machine Scheduling Problem (1993) (0)
- New Directions in Network Flows (1992) (0)
- New Advances in Solving the Weapon–Target Assignment Problem (2009) (0)
- Review of Generic Preflow Push Algorithm (2018) (0)
- North-Holland Recognizing hidden bicircular networks (1993) (0)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (2015) (0)
- A technique for speeding up the Lagrangean dual (1994) (0)
- Optimization Methods in Management Science (PDF) (2007) (0)
- M4 1 4 No.2.o>4f- *^^ Working Paper Alfred P. Sloan School of Management Finding Minimum-cost Flows Hy Double Scaling Finding Minimum-cost Flows I$y Double Scaling Finding Minimum-cost Flows by Double Scaling (2008) (0)
- On Geometric Stable Roommates and MinimumWeight Matching Robustness ( Extended Abstract ) ∗ (2007) (0)
- On the hardness of finding subsets with equal average (2013) (0)
- Computational Investigations of Flow Algorithms by Ravindra (0)
- Barcode ON NEXT TOUST (2008) (0)
- Clustering Data with Measurement Errors Working Draft (1998) (0)
- Chapter 13 SOLVING MULTI-CRITERIA THROUGH-FLEET ASSIGNMENT MODELS (2002) (0)
- For Peer Review Incremental Network Optimization: Theory & Algorithms (2007) (0)
- Topological Labeling of Periodic Graphs (1998) (0)
- ICS Student Paper Award Goes to (2007) (0)
- MIT Sloan School of Management (2006) (0)
- Arc Weighting in Hidden Bicircular Networks (1997) (0)
- MIT Open Access Articles Improved Algorithms for Computing Fisher's Market Clearing Prices (2022) (0)
- Analysis of a Proposed First Generation Physical Map of the Human Genome (1994) (0)
- D. Ray Fulkerson (2011) (0)
- 15.082J / 6.855J Network Optimization, Spring 2003 (2003) (0)
- epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems (2008) (0)
- A Fast FPTAS for Convex Stochastic Dynamic Programs (2012) (0)
This paper list is powered by the following services:
Other Resources About James B. Orlin
What Schools Are Affiliated With James B. Orlin?
James B. Orlin is affiliated with the following schools:
