Narrow search
Showing 1 - 10 of 351
Cover Image
Dynamic network flows
Orlin, James B. - 1981
Persistent link: https://www.econbiz.de/10000701334
Cover Image
Some very easy knapsack partition problems
Orlin, James B. - 1984
Persistent link: https://www.econbiz.de/10000716294
Cover Image
Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
Orlin, James B. - 1984
Persistent link: https://www.econbiz.de/10000716311
Cover Image
A dual version of Tardoss̀ algorithm for linear programming
Orlin, James B. - 1985
Persistent link: https://www.econbiz.de/10000716587
Cover Image
Some recent advances in network flows
Ahuja, Ravindra K.; Magnanti, Thomas L.; Orlin, James B. - 1989
Persistent link: https://www.econbiz.de/10000784626
Cover Image
Scale-invariant clustering with minimum volume ellipsoids
Kumar, Mahesh; Orlin, James B. - In: Computers & operations research : and their … 35 (2008) 4, pp. 1017-1029
Persistent link: https://www.econbiz.de/10003669834
Cover Image
Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
Halman, Nir; Orlin, James B.; Simchi-Levi, David - In: Operations research 60 (2012) 2, pp. 429-446
Persistent link: https://www.econbiz.de/10009554763
Cover Image
D. Ray Fulkerson
Bland, Robert G.; Orlin, James B. - In: Profiles in operations research : pioneers and innovators, (pp. 509-527). 2011
Persistent link: https://www.econbiz.de/10009260039
Cover Image
Complexity results for equistable graphs and related classes
Milanič, Martin; Orlin, James B.; Rudolf, Gábor - 2011
Persistent link: https://www.econbiz.de/10009296503
Cover Image
Single transferable vote resists strategic voting
Bartholdi, John J. - In: Social choice and welfare 8 (1991) 4, pp. 341-354
Persistent link: https://www.econbiz.de/10001112476