James B. Orlin

ScholarGPS® ID: 55126747912727

Affiliation
Massachusetts Institute of Technology, Cambridge, Massachusetts, United States
Affiliation History

Field
Business and Management
Discipline
Management Information Systems
Top Specialties
Mathematical Optimization | Combinatorial Optimization | Integer Programming | Discrete Mathematics | Linear Programming | Spanning Tree | Dynamic Programming | Single-source Publishing | Stochastic Process | Graph Theory | Metaheuristic | Nonlinear System | Optical Networking | Sensitivity Analysis
Metrics Summary
Publication Count
175
Predicted Citations
12,121
Predicted h-index
58
Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

  • Publications
  • Books
  • Patents
  • NIH/NSF
You must register and claim your profile to add or remove publications from it.
... publications
FILTER BY:
Year
Type
Specialty
Affiliations
Access
Co-Authors
Add
Delete
A fast maximum flow algorithm (journal article)
Orlin, James B. | Gong, Xiao‐yue
Networks, volume 77, issue 2, pages 287-321 (2021).
10.1002/net.22001
Cited by (4) | Cite | Source
Linearizable Special Cases of the Quadratic Shortest Path Problem (book chapter)
In Graph-Theoretic Concepts in Computer Science
Çela, Eranda | Klinz, Bettina | Lendl, Stefan | Orlin, James B. | Woeginger, Gerhard J. | Wulf, Lasse
Springer International Publishing (2021)
10.1007/978-3-030-86838-3_19
Cited by (2) | Cite | Source
Directed Shortest Paths via Approximate Cost Balancing (book chapter)
In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Orlin, James B. | Végh, László A.
Society for Industrial and Applied Mathematics (2021)
10.1137/1.9781611976465.16
Cited by (1) | Cite | Source
Distributionally Robust Max Flows (book chapter)
In Symposium on Simplicity in Algorithms
Chen, Louis L | Ma, Will | Orlin, James B | Simchi-Levi, David
Society for Industrial and Applied Mathematics (2020)
10.1137/1.9781611976014.12
Cited by (1) | Cite | Source
Robust monotone submodular function maximization (journal article)
Orlin, James B. | Schulz, Andreas S. | Udwani, Rajan
Mathematical Programming, volume 172, issue 1-2, pages 505-537 (2018).
10.1007/s10107-018-1320-2
Cited by (31) | Cite | Source | Open Access
On the complexity of energy storage problems (journal article)
Halman, Nir | Nannicini, Giacomo | Orlin, James
Discrete Optimization, volume 28 (2018).
10.1016/j.disopt.2017.11.001
Cited by (13) | Cite | Source
Randomized algorithms for finding the shortest negative cost cycle in networks (journal article)
Orlin, James B. | Subramani, K. | Wojciechowki, Piotr
Discrete Applied Mathematics, volume 236 (2018).
10.1016/j.dam.2017.10.011
Cited by (4) | Cite | Source
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications (book chapter)
In Handbook of Approximation Algorithms and Metaheuristics, Second Edition
Ahuja, Ravindra K. | Ergun, Özlem | Orlin, James B. | Punnen, Abraham P.
Chapman and Hall/CRC (2018)
10.1201/9781351236423-18
Cited by (3) | Cite | Source
An O ( nm ) time algorithm for finding the min length directed cycle in a graph (conference)
Orlin, James B. | Sedeño-Noda, Antonio
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (2017)
10.1137/1.9781611974782.122
Cited by (13) | Cite | Source | Open Access
A characterization of irreducible infeasible subsystems in flow networks (journal article)
Joormann, Imke | Orlin, James B. | Pfetsch, Marc E.
Networks, volume 68, issue 2, pages 121-129 (2016).
10.1002/net.21686
Cited by (2) | Cite | Source | Open Access
Robust Monotone Submodular Function Maximization (book chapter)
In Integer Programming and Combinatorial Optimization
Orlin, James B. | Schulz, Andreas S. | Udwani, Rajan
Springer International Publishing (2016)
10.1007/978-3-319-33461-5_26
Cited by (20) | Cite | Source | Open Access
On the power of randomization in network interdiction (journal article)
Bertsimas, Dimitris | Nasrabadi, Ebrahim | Orlin, James B.
Operations Research Letters, volume 44, issue 1, pages 114-120 (2016).
10.1016/j.orl.2015.11.005
Cited by (30) | Cite | Source | Open Access
Network Flows (book)
Ahuja, R. K. | Magnanti, T. L. | Orlin, J. B.
Cited by (1) | Cite
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (journal article)
Halman, Nir | Nannicini, Giacomo | Orlin, James
SIAM Journal on Optimization, volume 25, issue 1, pages 317-350 (2015).
10.1137/13094774X
Cited by (10) | Cite | Source | Open Access
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs (journal article)
Halman, Nir | Klabjan, Diego | Li, Chung-Lun | Orlin, James | Simchi-Levi, David
SIAM Journal on Discrete Mathematics, volume 28, issue 4, pages 1725-1796 (2014).
10.1137/130925153
Cited by (29) | Cite | Source | Open Access
Very Large-Scale Neighborhood Search (book chapter)
In Search Methodologies
Altner, Douglas S. | Ahuja, Ravindra K. | Ergun, Özlem | Orlin, James B.
Springer US (2014)
10.1007/978-1-4614-6940-7_13
Cited by (18) | Cite | Source
Fast algorithms for convex cost flow problems on circles, lines, and trees (journal article)
Orlin, James B. | Vaidyanathan, Balachandran
Networks, volume 62, issue 4, pages 288-296 (2013).
10.1002/net.21517
Cited by (4) | Cite | Source
On the hardness of finding subsets with equal average (journal article)
Elkind, Edith | Orlin, James B.
Information Processing Letters, volume 113, issue 13, pages 477-480 (2013).
10.1016/j.ipl.2013.04.001
Cite | Source
Max flows in O(nm) time, or better (conference)
Orlin, James B.
STOC'13: Symposium on Theory of Computing (2013)
Palo Alto California USA
10.1145/2488608.2488705
Cited by (244) | Cite | Source | Open Access
Simplifications and speedups of the pseudoflow algorithm (journal article)
Hochbaum, Dorit S. | Orlin, James B.
Networks, volume 61, issue 1, pages 40-57 (2013).
10.1002/net.21467
Cited by (18) | Cite | Source | Open Access