I agree that this site is using cookies. You can find further informations here.
X
Orlin, James B.
277  results:
Search for persons X
?
1

Directed Shortest Paths via Approximate Cost Balancing:

Orlin, James B. ; Végh, László
Journal of the ACM.  70 (2022)  1 - p. 1-33 , 2022
Link: https://doi.org/10.1145/..
 
?
2

Directed shortest paths via approximate cost balancing:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Orlin, James B. ; Végh, László A. - p. 235-254 , 2021
Link: https://dl.acm.org/doi/1..
 
?
3

Directed Shortest Paths via Approximate Cost Balancing:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Orlin, James B. ; Végh, László A. - p. 235-254 , 2021
Link: https://doi.org/10.1137/..
 
?
4

Linearizable Special Cases of the Quadratic Shortest Path P..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan... - p. 245-256 , 2021
Link: https://doi.org/10.1007/..
 
?
5

A fast maximum flow algorithm:

Orlin, James B. ; Gong, Xiao‐yue
Networks.  77 (2020)  2 - p. 287-321 , 2020
Link: https://doi.org/10.1002/..
 
?
6

Robust monotone submodular function maximization:

Orlin, James B. ; Schulz, Andreas S. ; Udwani, Rajan
Mathematical Programming.  172 (2018)  1-2 - p. 505-537 , 2018
Link: https://doi.org/10.1007/..
 
?
7

Randomized algorithms for finding the shortest negative cos..:

Orlin, James B. ; Subramani, K. ; Wojciechowki, Piotr
Discrete Applied Mathematics.  236 (2018)  - p. 387-394 , 2018
Link: https://doi.org/10.1016/..
 
?
8

An O(nm) time algorithm for finding the min length directed..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Orlin, James B. ; Sedeño-Noda, Antonio - p. 1866-1879 , 2017
Link: https://dl.acm.org/doi/1..
 
?
9

On the power of randomization in network interdiction:

Bertsimas, Dimitris ; Nasrabadi, Ebrahim ; Orlin, James B.
Operations Research Letters.  44 (2016)  1 - p. 114-120 , 2016
Link: https://doi.org/10.1016/..
 
?
10

A characterization of irreducible infeasible subsystems in ..:

Joormann, Imke ; Orlin, James B. ; Pfetsch, Marc E.
Networks.  68 (2016)  2 - p. 121-129 , 2016
Link: https://doi.org/10.1002/..
 
?
11

Max flows in O(nm) time, or better:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Orlin, James B. - p. 765-774 , 2013
Link: https://dl.acm.org/doi/1..
 
?
12

Fast algorithms for convex cost flow problems on circles, l..:

Orlin, James B. ; Vaidyanathan, Balachandran
Networks.  62 (2013)  4 - p. 288-296 , 2013
Link: https://doi.org/10.1002/..
 
?
13

On the hardness of finding subsets with equal average:

Elkind, Edith ; Orlin, James B.
Information Processing Letters.  113 (2013)  13 - p. 477-480 , 2013
Link: https://doi.org/10.1016/..
 
?
14

Simplifications and speedups of the pseudoflow algorithm:

Hochbaum, Dorit S. ; Orlin, James B.
Networks.  61 (2012)  1 - p. 40-57 , 2012
Link: https://doi.org/10.1002/..
 
?
15

Approximating the Nonlinear Newsvendor and Single-Item Stoc..:

Halman, Nir ; Orlin, James B. ; Simchi-Levi, David
Operations Research.  60 (2012)  2 - p. 429-446 , 2012
Link: https://www.jstor.org/st..
 
1-15