×

Goemans, Michel Xavier

Author ID: goemans.michel-x Recent zbMATH articles by "Goemans, Michel Xavier"
Published as: Goemans, Michel X.; Goemans, Michel; Goemans, M. X.
Homepage: https://klein.mit.edu/~goemans/
External Links: MGP · Wikidata · Google Scholar · dblp · GND · IdRef

Publications by Year

Citations contained in zbMATH Open

83 Publications have been cited 2,680 times in 2,134 Documents Cited by Year
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Zbl 0885.68088
Goemans, Michel X.; Williamson, David P.
785
1995
A general approximation technique for constrained forest problems. Zbl 0834.68055
Goemans, Michel X.; Williamson, David P.
213
1995
A note on the prize collecting traveling salesman problem. Zbl 0793.90089
Bienstock, Daniel; Goemans, Michel X.; Simchi-Levi, David; Williamson, David
88
1993
Improved approximation algorithms for network design problems. Zbl 0873.68005
Goemans, M. X.; Goldberg, A. V.; Plotkin, S.; Shmoys, D. B.; Tardos, É.; Williamson, D. P.
88
1994
Approximating the stochastic Knapsack problem: the benefit of adaptivity. Zbl 1218.90169
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
74
2008
Semidefinite programming in combinatorial optimization. Zbl 0887.90139
Goemans, Michel X.
66
1997
.878-approximation algorithms for MAX CUT and MAX 2SAT. Zbl 1345.68274
Goemans, Michel X.; Williamson, David P.
61
1994
An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. Zbl 1288.05259
Asadpour, Arash; Goemans, Michel X.; Mądry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin
55
2010
A catalog of Steiner tree formulations. Zbl 0794.90074
Goemans, Michel X.; Myung, Young-soo
55
1993
New \(3\over4\)-approximation algorithms for the maximum satisfiability problem. Zbl 0812.90129
Goemans, Michel X.; Williamson, David P.
54
1994
Survivable networks, linear programming relaxations and the parsimonious property. Zbl 0790.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
51
1993
Worst-case comparison of valid inequalities for the TSP. Zbl 0844.90101
Goemans, Michel X.
45
1995
Cooperative facility location games. Zbl 1106.91009
Goemans, Michel X.; Skutella, Martin
44
2004
Single machine scheduling with release dates. Zbl 1009.90096
Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang
41
2002
Smallest compact formulation for the permutahedron. Zbl 1322.90048
Goemans, Michel X.
40
2015
The Steiner tree polytope and related polyhedra. Zbl 0808.90124
Goemans, Michel X.
39
1994
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Zbl 0920.90137
Chudak, Fabián A.; Goemans, Michel X.; Hochbaum, Dorit S.; Williamson, David P.
37
1998
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 0838.90133
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
36
1995
The constrained minimum spanning tree problem (extended abstract). Zbl 1502.90184
Ravi, R.; Goemans, M. X.
36
1996
An improved approximation ratio for the minimum latency problem. Zbl 0920.90138
Goemans, Michel; Kleinberg, Jon
35
1998
Tight approximation algorithms for maximum general assignment problems. Zbl 1192.90105
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
35
2006
On the single-source unsplittable flow problem. Zbl 0947.90012
Dinitz, Yefim; Garg, Naveen; Goemans, Michel X.
32
1999
Polynomiality for bin packing with a constant number of item types. Zbl 1421.68080
Goemans, Michel X.; Rothvoß, Thomas
32
2014
Matroids and integrality gaps for hypergraphic Steiner tree relaxations. Zbl 1286.05024
Goemans, Michel X.; Olver, Neil; Rothvoß, Thomas; Zenklusen, Rico
31
2012
Adaptivity and approximation for stochastic packing problems. Zbl 1297.90135
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
31
2005
A general approximation technique for constrained forest problems. Zbl 0818.90124
Goemans, Michel X.; Williamson, David P.
29
1992
Tight approximation algorithms for maximum separable assignment problems. Zbl 1238.68187
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
29
2011
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1093.90038
Goemans, Michel X.; Williamson, David P.
29
2004
When does the positive semidefiniteness constraint help in lifting procedures? Zbl 1082.90548
Goemans, Michel X.; Tunçel, Levent
26
2001
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding. Zbl 1205.05125
Gabow, Harold N.; Goemans, Michel X.; Tardos, Éva; Williamson, David P.
25
2009
Improved approximation algorithms for scheduling with release dates. Zbl 1321.68502
Goemans, Michel X.
24
1997
Approximating submodular functions everywhere. Zbl 1421.68224
Goemans, Michel X.; Harvey, Nicholas J. A.; Iwata, Satoru; Mirrokni, Vahab
22
2009
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. Zbl 1380.90229
Asadpour, Arash; Goemans, Michel X.; Mądry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin
22
2017
Minimizing submodular functions over families of sets. Zbl 0840.90109
Goemans, M. X.; Ramakrishnan, V. S.
21
1995
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 0928.90094
Goemans, Michel X.; Williamson, David P.
15
1998
Cooperative facility location games. Zbl 0952.90021
Goemans, Michel X.; Skutella, Martin
15
2000
An improved approximation ratio for the minimum latency problem. Zbl 0845.90122
Goemans, Michel; Kleinberg, Jon
15
1996
On the integrality ratio for the asymmetric traveling salesman problem. Zbl 1278.90328
Charikar, Moses; Goemans, Michel X.; Karloff, Howard
15
2006
The Lovász theta function and a semidefinite programming relaxation of vertex cover. Zbl 0910.90262
Kleinberg, Jon; Goemans, Michel X.
14
1998
Stochastic covering and adaptivity. Zbl 1145.90427
Goemans, Michel; Vondrák, Jan
13
2006
Matroids are immune to Braess’ paradox. Zbl 1380.91034
Fujishige, Satoru; Goemans, Michel X.; Harks, Tobias; Peis, Britta; Zenklusen, Rico
13
2017
Combinatorial optimization. Zbl 0957.90514
Goemans, Michel; Rendl, Franz
13
2000
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Zbl 0733.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
12
1991
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 1310.90116
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
12
1993
A supermodular relaxation for scheduling with release dates. Zbl 1414.90149
Goemans, Michel X.
11
1996
Two-dimensional Gantt charts and a scheduling algorithm of Lawler. Zbl 1054.90032
Goemans, Michel X.; Williamson, David P.
11
2000
An efficient approximation algorithm for the survivable network design problem. Zbl 0922.90140
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
11
1998
Approximating minimum-cost graph problems with spanning tree edges. Zbl 0823.90125
Goemans, Michel X.; Williamson, David P.
10
1994
An approximation algorithm for scheduling on three dedicated machines. Zbl 0831.68006
Goemans, Michel X.
10
1995
An efficient approximation algorithm for the survivable network design problem. Zbl 0923.90136
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
10
1993
Arborescence polytopes for series-parallel graphs. Zbl 0802.05040
Goemans, Michel X.
10
1994
Semidefinite programming and combinatorial optimization. Zbl 0904.90129
Goemans, Michel X.
9
1998
Improved bounds for on-line load balancing. Zbl 0916.68013
Andrews, M.; Goemans, M. X.; Zhang, L.
8
1999
Semidefinite programs and association schemes. Zbl 0956.90029
Goemans, M. X.; Rendl, F.
8
1999
The strongest facets of the acyclic subgraph polytope are unknown. Zbl 1415.90135
Goemans, Michel X.; Hall, Leslie A.
8
1996
A lower bound on the expected cost of an optimal assignment. Zbl 0779.90066
Goemans, Michel X.; Kodialam, Muralidharan S.
8
1993
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. Zbl 1277.90113
Goemans, Michel X.; Soto, José A.
7
2013
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Zbl 0682.90068
Goemans, Michel X.
7
1989
A new \(\frac{3}{4}\)-approximation algorithm for \(\text{MAX SAT}\). Zbl 0929.90071
Goemans, Michel X.; Williamson, David P.
6
1993
A 1. 47-approximation for a preemptive single-machine scheduling problem. Zbl 0955.90025
Goemans, Michel X.; Wein, Joel M.; Williamson, David P.
6
2000
On the parsimonious property of connectivity problems. Zbl 0800.68635
Goemans, Michel X.; Bertsimas, Dimitris J.
6
1990
Deformable polygon representation and near-mincuts. Zbl 1163.05036
Benczúr, András A.; Goemans, Michel X.
6
2008
Congestion games viewed from M-convexity. Zbl 1408.91042
Fujishige, Satoru; Goemans, Michel; Harks, Tobias; Peis, Britta; Zenklusen, Rico
6
2015
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1323.90047
Goemans, Michel X.; Williamson, David
6
2001
Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. Zbl 1421.68203
Cheung, Wang Chi; Goemans, Michel X.; Wong, Sam Chiu-Wai
5
2014
Finite termination of “augmenting path” algorithms in the presence of irrational problem data. Zbl 1131.05314
Dean, Brian C.; Goemans, Michel X.; Immorlica, Nicole
5
2006
Improved approximation algorithms for minimum-space advertisement scheduling. Zbl 1039.68537
Dean, Brian C.; Goemans, Michel X.
4
2003
Covering minimum spanning trees of random subgraphs. Zbl 1108.05082
Goemans, Michel X.; Vondrák, Jan
4
2006
Improved bounds on nonblocking 3-stage Clos networks. Zbl 1144.68055
Correa, José R.; Goemans, Michel X.
4
2007
Wide partitions, Latin tableaux, and Rota’s basis conjecture. Zbl 1029.05049
Chow, Timothy Y.; Fan, C. Kenneth; Goemans, Michel X.; Vondrak, Jan
4
2003
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding. Zbl 1297.05130
Gabow, Harold N.; Goemans, Michel X.; Tardos, Éva; Williamson, David P.
3
2005
Discrete Newton’s algorithm for parametric submodular function minimization. Zbl 1418.90226
Goemans, Michel X.; Gupta, Swati; Jaillet, Patrick
3
2017
Polynomiality for bin packing with a constant number of item types. Zbl 1499.68428
Goemans, Michel X.; Rothvoss, Thomas
3
2020
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 1415.90101
Goemans, Michel X.; Williamson, David P.
2
1996
A flow model based on polylinking system. Zbl 1262.90144
Goemans, Michel X.; Iwata, Satoru; Zenklusen, Rico
2
2012
Computational experience with an approximation algorithm on large-scale Euclidean matching instances. Zbl 0855.90074
Williamson, David P.; Goemans, Michel X.
2
1996
Covering minimum spanning trees of random subgraphs. Zbl 1318.05068
Goemans, Michel X.; Vondrák, Jan
1
2004
On the maximum number of triangles in wheel-free graphs. Zbl 0808.05062
Füredi, Zoltán; Goemans, Michel X.; Kleitman, Daniel J.
1
1994
2-change for k-connected networks. Zbl 0717.90078
Goemans, Michel X.; Talluri, Kalyan T.
1
1991
An approximate König’s theorem for edge-coloring weighted bipartite graphs. Zbl 1192.05046
Correa, José R.; Goemans, Michel X.
1
2004
Approximating incremental combinatorial optimization problems. Zbl 1467.68215
Goemans, Michel X.; Unda, Francisco
1
2017
Approximate edge splitting. Zbl 0961.05043
Goemans, Michel X.
1
2001
Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approximation techniques in computer science, RANDOM 2001, Berkeley, CA, USA, August 18–20, 2001. Proceedings. Zbl 0969.00095
1
2001
Polynomiality for bin packing with a constant number of item types. Zbl 1499.68428
Goemans, Michel X.; Rothvoss, Thomas
3
2020
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. Zbl 1380.90229
Asadpour, Arash; Goemans, Michel X.; Mądry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin
22
2017
Matroids are immune to Braess’ paradox. Zbl 1380.91034
Fujishige, Satoru; Goemans, Michel X.; Harks, Tobias; Peis, Britta; Zenklusen, Rico
13
2017
Discrete Newton’s algorithm for parametric submodular function minimization. Zbl 1418.90226
Goemans, Michel X.; Gupta, Swati; Jaillet, Patrick
3
2017
Approximating incremental combinatorial optimization problems. Zbl 1467.68215
Goemans, Michel X.; Unda, Francisco
1
2017
Smallest compact formulation for the permutahedron. Zbl 1322.90048
Goemans, Michel X.
40
2015
Congestion games viewed from M-convexity. Zbl 1408.91042
Fujishige, Satoru; Goemans, Michel; Harks, Tobias; Peis, Britta; Zenklusen, Rico
6
2015
Polynomiality for bin packing with a constant number of item types. Zbl 1421.68080
Goemans, Michel X.; Rothvoß, Thomas
32
2014
Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. Zbl 1421.68203
Cheung, Wang Chi; Goemans, Michel X.; Wong, Sam Chiu-Wai
5
2014
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. Zbl 1277.90113
Goemans, Michel X.; Soto, José A.
7
2013
Matroids and integrality gaps for hypergraphic Steiner tree relaxations. Zbl 1286.05024
Goemans, Michel X.; Olver, Neil; Rothvoß, Thomas; Zenklusen, Rico
31
2012
A flow model based on polylinking system. Zbl 1262.90144
Goemans, Michel X.; Iwata, Satoru; Zenklusen, Rico
2
2012
Tight approximation algorithms for maximum separable assignment problems. Zbl 1238.68187
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
29
2011
An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. Zbl 1288.05259
Asadpour, Arash; Goemans, Michel X.; Mądry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin
55
2010
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding. Zbl 1205.05125
Gabow, Harold N.; Goemans, Michel X.; Tardos, Éva; Williamson, David P.
25
2009
Approximating submodular functions everywhere. Zbl 1421.68224
Goemans, Michel X.; Harvey, Nicholas J. A.; Iwata, Satoru; Mirrokni, Vahab
22
2009
Approximating the stochastic Knapsack problem: the benefit of adaptivity. Zbl 1218.90169
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
74
2008
Deformable polygon representation and near-mincuts. Zbl 1163.05036
Benczúr, András A.; Goemans, Michel X.
6
2008
Improved bounds on nonblocking 3-stage Clos networks. Zbl 1144.68055
Correa, José R.; Goemans, Michel X.
4
2007
Tight approximation algorithms for maximum general assignment problems. Zbl 1192.90105
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
35
2006
On the integrality ratio for the asymmetric traveling salesman problem. Zbl 1278.90328
Charikar, Moses; Goemans, Michel X.; Karloff, Howard
15
2006
Stochastic covering and adaptivity. Zbl 1145.90427
Goemans, Michel; Vondrák, Jan
13
2006
Finite termination of “augmenting path” algorithms in the presence of irrational problem data. Zbl 1131.05314
Dean, Brian C.; Goemans, Michel X.; Immorlica, Nicole
5
2006
Covering minimum spanning trees of random subgraphs. Zbl 1108.05082
Goemans, Michel X.; Vondrák, Jan
4
2006
Adaptivity and approximation for stochastic packing problems. Zbl 1297.90135
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
31
2005
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding. Zbl 1297.05130
Gabow, Harold N.; Goemans, Michel X.; Tardos, Éva; Williamson, David P.
3
2005
Cooperative facility location games. Zbl 1106.91009
Goemans, Michel X.; Skutella, Martin
44
2004
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1093.90038
Goemans, Michel X.; Williamson, David P.
29
2004
Covering minimum spanning trees of random subgraphs. Zbl 1318.05068
Goemans, Michel X.; Vondrák, Jan
1
2004
An approximate König’s theorem for edge-coloring weighted bipartite graphs. Zbl 1192.05046
Correa, José R.; Goemans, Michel X.
1
2004
Improved approximation algorithms for minimum-space advertisement scheduling. Zbl 1039.68537
Dean, Brian C.; Goemans, Michel X.
4
2003
Wide partitions, Latin tableaux, and Rota’s basis conjecture. Zbl 1029.05049
Chow, Timothy Y.; Fan, C. Kenneth; Goemans, Michel X.; Vondrak, Jan
4
2003
Single machine scheduling with release dates. Zbl 1009.90096
Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang
41
2002
When does the positive semidefiniteness constraint help in lifting procedures? Zbl 1082.90548
Goemans, Michel X.; Tunçel, Levent
26
2001
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1323.90047
Goemans, Michel X.; Williamson, David
6
2001
Approximate edge splitting. Zbl 0961.05043
Goemans, Michel X.
1
2001
Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approximation techniques in computer science, RANDOM 2001, Berkeley, CA, USA, August 18–20, 2001. Proceedings. Zbl 0969.00095
1
2001
Cooperative facility location games. Zbl 0952.90021
Goemans, Michel X.; Skutella, Martin
15
2000
Combinatorial optimization. Zbl 0957.90514
Goemans, Michel; Rendl, Franz
13
2000
Two-dimensional Gantt charts and a scheduling algorithm of Lawler. Zbl 1054.90032
Goemans, Michel X.; Williamson, David P.
11
2000
A 1. 47-approximation for a preemptive single-machine scheduling problem. Zbl 0955.90025
Goemans, Michel X.; Wein, Joel M.; Williamson, David P.
6
2000
On the single-source unsplittable flow problem. Zbl 0947.90012
Dinitz, Yefim; Garg, Naveen; Goemans, Michel X.
32
1999
Improved bounds for on-line load balancing. Zbl 0916.68013
Andrews, M.; Goemans, M. X.; Zhang, L.
8
1999
Semidefinite programs and association schemes. Zbl 0956.90029
Goemans, M. X.; Rendl, F.
8
1999
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Zbl 0920.90137
Chudak, Fabián A.; Goemans, Michel X.; Hochbaum, Dorit S.; Williamson, David P.
37
1998
An improved approximation ratio for the minimum latency problem. Zbl 0920.90138
Goemans, Michel; Kleinberg, Jon
35
1998
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 0928.90094
Goemans, Michel X.; Williamson, David P.
15
1998
The Lovász theta function and a semidefinite programming relaxation of vertex cover. Zbl 0910.90262
Kleinberg, Jon; Goemans, Michel X.
14
1998
An efficient approximation algorithm for the survivable network design problem. Zbl 0922.90140
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
11
1998
Semidefinite programming and combinatorial optimization. Zbl 0904.90129
Goemans, Michel X.
9
1998
Semidefinite programming in combinatorial optimization. Zbl 0887.90139
Goemans, Michel X.
66
1997
Improved approximation algorithms for scheduling with release dates. Zbl 1321.68502
Goemans, Michel X.
24
1997
The constrained minimum spanning tree problem (extended abstract). Zbl 1502.90184
Ravi, R.; Goemans, M. X.
36
1996
An improved approximation ratio for the minimum latency problem. Zbl 0845.90122
Goemans, Michel; Kleinberg, Jon
15
1996
A supermodular relaxation for scheduling with release dates. Zbl 1414.90149
Goemans, Michel X.
11
1996
The strongest facets of the acyclic subgraph polytope are unknown. Zbl 1415.90135
Goemans, Michel X.; Hall, Leslie A.
8
1996
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 1415.90101
Goemans, Michel X.; Williamson, David P.
2
1996
Computational experience with an approximation algorithm on large-scale Euclidean matching instances. Zbl 0855.90074
Williamson, David P.; Goemans, Michel X.
2
1996
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Zbl 0885.68088
Goemans, Michel X.; Williamson, David P.
785
1995
A general approximation technique for constrained forest problems. Zbl 0834.68055
Goemans, Michel X.; Williamson, David P.
213
1995
Worst-case comparison of valid inequalities for the TSP. Zbl 0844.90101
Goemans, Michel X.
45
1995
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 0838.90133
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
36
1995
Minimizing submodular functions over families of sets. Zbl 0840.90109
Goemans, M. X.; Ramakrishnan, V. S.
21
1995
An approximation algorithm for scheduling on three dedicated machines. Zbl 0831.68006
Goemans, Michel X.
10
1995
Improved approximation algorithms for network design problems. Zbl 0873.68005
Goemans, M. X.; Goldberg, A. V.; Plotkin, S.; Shmoys, D. B.; Tardos, É.; Williamson, D. P.
88
1994
.878-approximation algorithms for MAX CUT and MAX 2SAT. Zbl 1345.68274
Goemans, Michel X.; Williamson, David P.
61
1994
New \(3\over4\)-approximation algorithms for the maximum satisfiability problem. Zbl 0812.90129
Goemans, Michel X.; Williamson, David P.
54
1994
The Steiner tree polytope and related polyhedra. Zbl 0808.90124
Goemans, Michel X.
39
1994
Approximating minimum-cost graph problems with spanning tree edges. Zbl 0823.90125
Goemans, Michel X.; Williamson, David P.
10
1994
Arborescence polytopes for series-parallel graphs. Zbl 0802.05040
Goemans, Michel X.
10
1994
On the maximum number of triangles in wheel-free graphs. Zbl 0808.05062
Füredi, Zoltán; Goemans, Michel X.; Kleitman, Daniel J.
1
1994
A note on the prize collecting traveling salesman problem. Zbl 0793.90089
Bienstock, Daniel; Goemans, Michel X.; Simchi-Levi, David; Williamson, David
88
1993
A catalog of Steiner tree formulations. Zbl 0794.90074
Goemans, Michel X.; Myung, Young-soo
55
1993
Survivable networks, linear programming relaxations and the parsimonious property. Zbl 0790.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
51
1993
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 1310.90116
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
12
1993
An efficient approximation algorithm for the survivable network design problem. Zbl 0923.90136
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
10
1993
A lower bound on the expected cost of an optimal assignment. Zbl 0779.90066
Goemans, Michel X.; Kodialam, Muralidharan S.
8
1993
A new \(\frac{3}{4}\)-approximation algorithm for \(\text{MAX SAT}\). Zbl 0929.90071
Goemans, Michel X.; Williamson, David P.
6
1993
A general approximation technique for constrained forest problems. Zbl 0818.90124
Goemans, Michel X.; Williamson, David P.
29
1992
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Zbl 0733.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
12
1991
2-change for k-connected networks. Zbl 0717.90078
Goemans, Michel X.; Talluri, Kalyan T.
1
1991
On the parsimonious property of connectivity problems. Zbl 0800.68635
Goemans, Michel X.; Bertsimas, Dimitris J.
6
1990
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Zbl 0682.90068
Goemans, Michel X.
7
1989
all top 5

Cited by 3,077 Authors

34 Williamson, David P.
25 Xu, Dachuan
24 Nutov, Zeev
24 Ravi, Ramamoorthi
21 Gupta, Anupam
21 Nagarajan, Viswanath
18 Kortsarz, Guy
18 Rendl, Franz
17 Du, Donglei
17 Goemans, Michel Xavier
16 Anjos, Miguel F.
16 Levin, Asaf
14 Wu, Chenchen
14 Zenklusen, Rico
13 Shmoys, David B.
12 Feige, Uriel
12 Hajiaghayi, Mohammad Taghi
12 Kurpisz, Adam
12 Lisser, Abdel
12 Mahjoub, Ali Ridha
11 Cheriyan, Joseph
11 Fiorini, Samuel
11 Maffioli, Francesco
11 Pardalos, Panos M.
11 Shachnai, Hadas
11 Singh, Mohit
11 Sitters, Rene A.
11 Skutella, Martin
11 Traub, Vera
10 Ben-Ameur, Walid
10 Bertsimas, Dimitris John
10 Grandoni, Fabrizio
10 Jansen, Klaus
10 Khot, Subhash Ajit
10 Könemann, Jochen
10 Laurent, Monique
10 Letchford, Adam N.
10 Ljubić, Ivana
10 Mastrolilli, Monaldo
10 Swamy, Chaitanya
10 Vygen, Jens
10 Xia, Yong
9 Arora, Sanjeev
9 Hoefer, Martin
9 Lu, Cheng
9 Megow, Nicole
9 Naor, Assaf
9 Pokutta, Sebastian
9 Saurabh, Saket
9 Svensson, Ola
9 Sviridenko, Maxim I.
9 Tunçel, Levent
9 Vazirani, Vijay V.
9 Xu, Chengxian
8 Bazgan, Cristina
8 Chekuri, Chandra S.
8 Epstein, Leah
8 Fukunaga, Takuro
8 Gouveia, Luis
8 O’Donnell, Ryan
8 Parrilo, Pablo A.
8 Segev, Danny
8 Singer, Amit
8 Stein, Clifford
8 Verschae, José
8 Wiegele, Angelika
8 Ye, Yinyu
8 Zhang, Xiaoyan
7 Boyd, Sylvia C.
7 Buchbinder, Niv
7 Chen, Xujin
7 Chimani, Markus
7 Fang, Qizhi
7 Frieze, Alan Michael
7 Garg, Naveen Kumar
7 Karpinski, Marek
7 Kawarabayashi, Ken-ichi
7 Kolliopoulos, Stavros G.
7 Krishnaswamy, Ravishankar
7 Li, Duan
7 Manthey, Bodo
7 Mnich, Matthias
7 Schwartz, Roy
7 Sudakov, Benny
7 Sun, Jian
7 Toriello, Alejandro
7 Vempala, Santosh S.
7 Xu, Fengmin
7 Zhang, Peng
7 Zhang, Shuzhong
6 Bandeira, Afonso S.
6 Bansal, Nikhil
6 Byrka, Jarosław
6 Chakrabarty, Deeparnab
6 Feldman, Moran
6 Haouari, Mohamed
6 Kerivin, Hervé L. M.
6 Khandekar, Rohit
6 Kim, Sunyoung
6 Knop, Dušan
...and 2,977 more Authors
all top 5

Cited in 220 Serials

172 Mathematical Programming. Series A. Series B
107 Discrete Applied Mathematics
87 Theoretical Computer Science
77 Operations Research Letters
68 Algorithmica
60 European Journal of Operational Research
56 Journal of Combinatorial Optimization
42 Journal of Global Optimization
39 Networks
38 Information Processing Letters
37 Discrete Optimization
34 SIAM Journal on Computing
32 Computers & Operations Research
32 SIAM Journal on Optimization
31 Mathematics of Operations Research
30 Journal of Computer and System Sciences
28 SIAM Journal on Discrete Mathematics
26 Optimization Letters
24 Optimization Methods & Software
23 Annals of Operations Research
23 Computational Optimization and Applications
22 Theory of Computing Systems
19 INFORMS Journal on Computing
18 Journal of Scheduling
15 Operations Research
13 Linear Algebra and its Applications
12 Journal of Combinatorial Theory. Series B
12 RAIRO. Operations Research
11 Discrete Mathematics
11 Random Structures & Algorithms
11 International Transactions in Operational Research
11 Journal of Machine Learning Research (JMLR)
10 Artificial Intelligence
10 Cybernetics and Systems Analysis
10 Quantum Information Processing
9 Journal of Optimization Theory and Applications
9 Discrete & Computational Geometry
8 Applied Mathematics and Computation
8 Journal of Discrete Algorithms
8 Mathematical Programming Computation
8 Journal of the Operations Research Society of China
7 Journal of Computational and Applied Mathematics
7 Naval Research Logistics
7 Foundations of Computational Mathematics
6 Automatica
6 Information Sciences
6 Combinatorica
6 Optimization
6 Asia-Pacific Journal of Operational Research
6 Games and Economic Behavior
6 Mathematical Problems in Engineering
6 Journal of Industrial and Management Optimization
5 Israel Journal of Mathematics
5 Information and Computation
5 Applied Mathematical Modelling
5 Bulletin of the American Mathematical Society. New Series
5 Computational Complexity
5 Applied and Computational Harmonic Analysis
5 Theory of Computing
4 The Annals of Statistics
4 Journal of Scientific Computing
4 Machine Learning
4 Numerical Algorithms
4 The Electronic Journal of Combinatorics
4 Top
4 Journal of the ACM
4 Algorithms
4 Science China. Mathematics
3 INFOR
3 Journal of Combinatorial Theory. Series A
3 Journal of the London Mathematical Society. Second Series
3 Journal of Pure and Applied Algebra
3 Acta Mathematicae Applicatae Sinica. English Series
3 SIAM Review
3 Applied Mathematics. Series B (English Edition)
3 International Journal of Computer Vision
3 Mathematical Methods of Operations Research
3 International Game Theory Review
3 4OR
3 ACM Journal of Experimental Algorithmics
3 Oberwolfach Reports
3 SIAM Journal on Imaging Sciences
3 Numerical Algebra, Control and Optimization
3 EURO Journal on Computational Optimization
3 SIAM Journal on Applied Algebra and Geometry
2 Communications on Pure and Applied Mathematics
2 Physica A
2 Acta Mathematica
2 International Journal of Game Theory
2 Journal of Economic Theory
2 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods
2 Opsearch
2 Proceedings of the American Mathematical Society
2 European Journal of Combinatorics
2 Systems & Control Letters
2 Physica D
2 Graphs and Combinatorics
2 Journal of Symbolic Computation
2 Probability Theory and Related Fields
2 SIAM Journal on Matrix Analysis and Applications
...and 120 more Serials
all top 5

Cited in 51 Fields

1,536 Operations research, mathematical programming (90-XX)
941 Computer science (68-XX)
443 Combinatorics (05-XX)
125 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
63 Numerical analysis (65-XX)
49 Convex and discrete geometry (52-XX)
43 Statistics (62-XX)
33 Probability theory and stochastic processes (60-XX)
32 Linear and multilinear algebra; matrix theory (15-XX)
28 Quantum theory (81-XX)
27 Information and communication theory, circuits (94-XX)
19 Calculus of variations and optimal control; optimization (49-XX)
18 Algebraic geometry (14-XX)
13 Biology and other natural sciences (92-XX)
13 Systems theory; control (93-XX)
12 Functional analysis (46-XX)
12 Statistical mechanics, structure of matter (82-XX)
8 Mathematical logic and foundations (03-XX)
6 General and overarching topics; collections (00-XX)
6 Order, lattices, ordered algebraic structures (06-XX)
6 Number theory (11-XX)
6 Operator theory (47-XX)
5 Commutative algebra (13-XX)
5 Group theory and generalizations (20-XX)
4 Measure and integration (28-XX)
4 Functions of a complex variable (30-XX)
4 Geometry (51-XX)
4 Differential geometry (53-XX)
4 Optics, electromagnetic theory (78-XX)
3 Real functions (26-XX)
3 Partial differential equations (35-XX)
3 Abstract harmonic analysis (43-XX)
2 History and biography (01-XX)
2 Field theory and polynomials (12-XX)
2 Special functions (33-XX)
2 Dynamical systems and ergodic theory (37-XX)
2 Harmonic analysis on Euclidean spaces (42-XX)
2 Global analysis, analysis on manifolds (58-XX)
2 Mechanics of deformable solids (74-XX)
1 General algebraic systems (08-XX)
1 Nonassociative rings and algebras (17-XX)
1 Topological groups, Lie groups (22-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Ordinary differential equations (34-XX)
1 Difference and functional equations (39-XX)
1 Approximations and expansions (41-XX)
1 General topology (54-XX)
1 Manifolds and cell complexes (57-XX)
1 Mechanics of particles and systems (70-XX)
1 Fluid mechanics (76-XX)
1 Mathematics education (97-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.