Narrow search
Showing 1 - 7 of 7
Cover Image
Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
Levi, Retsef; Lodi, Andrea; Sviridenko, Maxim - In: Mathematics of operations research 33 (2008) 2, pp. 461-474
Persistent link: https://www.econbiz.de/10003732456
Cover Image
On the maximum quadratic assignment problem
Nagarajan, Viswanath; Sviridenko, Maxim - In: Mathematics of operations research 34 (2009) 4, pp. 859-868
Persistent link: https://www.econbiz.de/10003919385
Cover Image
Submodular maximization over multiple matroids via generalized exchange properties
Lee, Jon; Sviridenko, Maxim; Vondrák, Ian - In: Mathematics of operations research 35 (2010) 4, pp. 795-806
Persistent link: https://www.econbiz.de/10008823146
Cover Image
Unrelated machine scheduling with stochastic processing times
Skutella, Martin; Sviridenko, Maxim; Uetz, Marc - In: Mathematics of operations research 41 (2016) 3, pp. 851-864
Persistent link: https://www.econbiz.de/10011520581
Cover Image
Submodular stochastic probing on matroids
Adamczyk, Marek; Sviridenko, Maxim; Ward, Justin P. - In: Mathematics of operations research 41 (2016) 3, pp. 1022-1038
Persistent link: https://www.econbiz.de/10011520800
Cover Image
Tight approximation algorithms for maximum separable assignment problems
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; … - In: Mathematics of operations research 36 (2011) 3, pp. 416-431
Persistent link: https://www.econbiz.de/10009300413
Cover Image
Optimal approximation for submodular and supermodular optimization with bounded curvature
Sviridenko, Maxim; Vondrák, Jan; Ward, Justin - In: Mathematics of operations research 42 (2017) 4, pp. 1197-1218
Persistent link: https://www.econbiz.de/10011773315