Narrow search
Showing 1 - 7 of 7
Cover Image
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Goemans, Michel X.; Tunçel, Levent - In: Mathematics of operations research 26 (2001) 4, pp. 796-815
Persistent link: https://www.econbiz.de/10006418713
Cover Image
A Lower Bound on the Expected Cost of an Optimal Assignment
Goemans, Michel X.; Kodialam, Muralidharan S. - In: Mathematics of operations research 18 (1993) 2, pp. 267-274
Persistent link: https://www.econbiz.de/10006421336
Cover Image
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Charikar, Moses; Goemans, Michel X.; Karloff, Howard - In: Mathematics of operations research 31 (2006) 2, pp. 245-252
Persistent link: https://www.econbiz.de/10007282692
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-432
Persistent link: https://www.econbiz.de/10009256487
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
Approximating the stochastic knapsack problem : the benefit of adaptivity
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan - In: Mathematics of operations research 33 (2008) 4, pp. 945-964
Persistent link: https://www.econbiz.de/10003791292
Cover Image
Matroids are immune to Braess' paradox
Fujishige, Satoru; Goemans, Michel X.; Harks, Tobias; … - In: Mathematics of operations research 42 (2017) 3, pp. 745-761
Persistent link: https://www.econbiz.de/10011742479