×

zbMATH — the first resource for mathematics

Goemans, Michel X.

Compute Distance To:
Author ID: goemans.michel-x Recent zbMATH articles by "Goemans, Michel X."
Published as: Goemans, M. X.; Goemans, Michel; Goemans, Michel X.
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 91 Publications since 1989, including 2 Books

Publications by Year

Citations contained in zbMATH

74 Publications have been cited 1,659 times in 1,333 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.
504
1995
A general approximation technique for constrained forest problems. Zbl 0834.68055
Goemans, Michel X.; Williamson, David P.
131
1995
A note on the prize collecting traveling salesman problem. Zbl 0793.90089
Bienstock, Daniel; Goemans, Michel X.; Simchi-Levi, David; Williamson, David
52
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.
49
1994
Semidefinite programming in combinatorial optimization. Zbl 0887.90139
Goemans, Michel X.
48
1997
Approximating the stochastic Knapsack problem: the benefit of adaptivity. Zbl 1218.90169
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
42
2008
Survivable networks, linear programming relaxations and the parsimonious property. Zbl 0790.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
41
1993
New \(3\over4\)-approximation algorithms for the maximum satisfiability problem. Zbl 0812.90129
Goemans, Michel X.; Williamson, David P.
37
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
36
2010
Cooperative facility location games. Zbl 1106.91009
Goemans, Michel X.; Skutella, Martin
36
2004
A catalog of Steiner tree formulations. Zbl 0794.90074
Goemans, Michel X.; Myung, Young-soo
33
1993
Worst-case comparison of valid inequalities for the TSP. Zbl 0844.90101
Goemans, Michel X.
32
1995
Single machine scheduling with release dates. Zbl 1009.90096
Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang
29
2002
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.
28
1998
.878-approximation algorithms for MAX CUT and MAX 2SAT. Zbl 1345.68274
Goemans, Michel X.; Williamson, David P.
28
1994
The Steiner tree polytope and related polyhedra. Zbl 0808.90124
Goemans, Michel X.
28
1994
Smallest compact formulation for the permutahedron. Zbl 1322.90048
Goemans, Michel X.
24
2015
An improved approximation ratio for the minimum latency problem. Zbl 0920.90138
Goemans, Michel; Kleinberg, Jon
24
1998
A general approximation technique for constrained forest problems. Zbl 0818.90124
Goemans, Michel X.; Williamson, David P.
23
1992
Tight approximation algorithms for maximum general assignment problems. Zbl 1192.90105
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
22
2006
On the single-source unsplittable flow problem. Zbl 0947.90012
Dinitz, Yefim; Garg, Naveen; Goemans, Michel X.
22
1999
Improved approximation algorithms for scheduling with release dates. Zbl 1321.68502
Goemans, Michel X.
20
1997
When does the positive semidefiniteness constraint help in lifting procedures? Zbl 1082.90548
Goemans, Michel X.; Tunçel, Levent
19
2001
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 0838.90133
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
19
1995
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1093.90038
Goemans, Michel X.; Williamson, David P.
18
2004
Adaptivity and approximation for stochastic packing problems. Zbl 1297.90135
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
17
2005
Combinatorial optimization. Zbl 0957.90514
Goemans, Michel; Rendl, Franz
13
2000
An improved approximation ratio for the minimum latency problem. Zbl 0845.90122
Goemans, Michel; Kleinberg, Jon
13
1996
The Lovász theta function and a semidefinite programming relaxation of vertex cover. Zbl 0910.90262
Kleinberg, Jon; Goemans, Michel X.
12
1998
Matroids and integrality gaps for hypergraphic Steiner tree relaxations. Zbl 1286.05024
Goemans, Michel X.; Olver, Neil; Rothvoß, Thomas; Zenklusen, Rico
11
2012
Minimizing submodular functions over families of sets. Zbl 0840.90109
Goemans, M. X.; Ramakrishnan, V. S.
11
1995
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Zbl 0733.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
11
1991
Cooperative facility location games. Zbl 0952.90021
Goemans, Michel X.; Skutella, Martin
10
2000
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 0928.90094
Goemans, Michel X.; Williamson, David P.
10
1998
Polynomiality for bin packing with a constant number of item types. Zbl 1421.68080
Goemans, Michel X.; Rothvoß, Thomas
9
2014
Tight approximation algorithms for maximum separable assignment problems. Zbl 1238.68187
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
9
2011
Stochastic covering and adaptivity. Zbl 1145.90427
Goemans, Michel; Vondrák, Jan
9
2006
An approximation algorithm for scheduling on three dedicated machines. Zbl 0831.68006
Goemans, Michel X.
9
1995
A primal-dual approximation algorithm for generalized Steiner network problems. Zbl 1310.90116
Williamson, David P.; Goemans, Michel X.; Mihail, Milena; Vazirani, Vijay V.
9
1993
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.
8
2009
Two-dimensional Gantt charts and a scheduling algorithm of Lawler. Zbl 1054.90032
Goemans, Michel X.; Williamson, David P.
8
2000
Semidefinite programs and association schemes. Zbl 0956.90029
Goemans, M. X.; Rendl, F.
8
1999
An efficient approximation algorithm for the survivable network design problem. Zbl 0923.90136
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
8
1993
Matroids are immune to Braess’ paradox. Zbl 1380.91034
Fujishige, Satoru; Goemans, Michel X.; Harks, Tobias; Peis, Britta; Zenklusen, Rico
7
2017
Approximating submodular functions everywhere. Zbl 1421.68224
Goemans, Michel X.; Harvey, Nicholas J. A.; Iwata, Satoru; Mirrokni, Vahab
7
2009
On the integrality ratio for the asymmetric traveling salesman problem. Zbl 1278.90328
Charikar, Moses; Goemans, Michel X.; Karloff, Howard
7
2006
An efficient approximation algorithm for the survivable network design problem. Zbl 0922.90140
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
7
1998
Semidefinite programming and combinatorial optimization. Zbl 0904.90129
Goemans, Michel X.
7
1998
A supermodular relaxation for scheduling with release dates. Zbl 1414.90149
Goemans, Michel X.
7
1996
On the parsimonious property of connectivity problems. Zbl 0800.68635
Goemans, Michel X.; Bertsimas, Dimitris J.
7
1990
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
Approximating minimum-cost graph problems with spanning tree edges. Zbl 0823.90125
Goemans, Michel X.; Williamson, David P.
6
1994
Arborescence polytopes for series-parallel graphs. Zbl 0802.05040
Goemans, Michel X.
6
1994
A lower bound on the expected cost of an optimal assignment. Zbl 0779.90066
Goemans, Michel X.; Kodialam, Muralidharan S.
6
1993
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Zbl 0682.90068
Goemans, Michel X.
6
1989
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
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1323.90047
Goemans, Michel X.; Williamson, David
5
2001
Improved bounds for on-line load balancing. Zbl 0916.68013
Andrews, M.; Goemans, M. X.; Zhang, L.
5
1999
A new \(\frac{3}{4}\)-approximation algorithm for \(\text{MAX SAT}\). Zbl 0929.90071
Goemans, Michel X.; Williamson, David P.
5
1993
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. Zbl 1277.90113
Goemans, Michel X.; Soto, José A.
4
2013
The strongest facets of the acyclic subgraph polytope are unknown. Zbl 1415.90135
Goemans, Michel X.; Hall, Leslie A.
4
1996
Covering minimum spanning trees of random subgraphs. Zbl 1108.05082
Goemans, Michel X.; Vondrák, Jan
3
2006
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
Wide partitions, Latin tableaux, and Rota’s basis conjecture. Zbl 1029.05049
Chow, Timothy Y.; Fan, C. Kenneth; Goemans, Michel X.; Vondrak, Jan
3
2003
Congestion games viewed from M-convexity. Zbl 1408.91042
Fujishige, Satoru; Goemans, Michel; Harks, Tobias; Peis, Britta; Zenklusen, Rico
2
2015
A flow model based on polylinking system. Zbl 1262.90144
Goemans, Michel X.; Iwata, Satoru; Zenklusen, Rico
2
2012
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 1415.90101
Goemans, Michel X.; Williamson, David P.
2
1996
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
1
2017
Improved bounds on nonblocking 3-stage Clos networks. Zbl 1144.68055
Correa, José R.; Goemans, Michel X.
1
2007
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.
1
2003
Computational experience with an approximation algorithm on large-scale Euclidean matching instances. Zbl 0855.90074
Williamson, David P.; Goemans, Michel X.
1
1996
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
Matroids are immune to Braess’ paradox. Zbl 1380.91034
Fujishige, Satoru; Goemans, Michel X.; Harks, Tobias; Peis, Britta; Zenklusen, Rico
7
2017
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
1
2017
Smallest compact formulation for the permutahedron. Zbl 1322.90048
Goemans, Michel X.
24
2015
Congestion games viewed from M-convexity. Zbl 1408.91042
Fujishige, Satoru; Goemans, Michel; Harks, Tobias; Peis, Britta; Zenklusen, Rico
2
2015
Polynomiality for bin packing with a constant number of item types. Zbl 1421.68080
Goemans, Michel X.; Rothvoß, Thomas
9
2014
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations. Zbl 1277.90113
Goemans, Michel X.; Soto, José A.
4
2013
Matroids and integrality gaps for hypergraphic Steiner tree relaxations. Zbl 1286.05024
Goemans, Michel X.; Olver, Neil; Rothvoß, Thomas; Zenklusen, Rico
11
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
9
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
36
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.
8
2009
Approximating submodular functions everywhere. Zbl 1421.68224
Goemans, Michel X.; Harvey, Nicholas J. A.; Iwata, Satoru; Mirrokni, Vahab
7
2009
Approximating the stochastic Knapsack problem: the benefit of adaptivity. Zbl 1218.90169
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
42
2008
Improved bounds on nonblocking 3-stage Clos networks. Zbl 1144.68055
Correa, José R.; Goemans, Michel X.
1
2007
Tight approximation algorithms for maximum general assignment problems. Zbl 1192.90105
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim
22
2006
Stochastic covering and adaptivity. Zbl 1145.90427
Goemans, Michel; Vondrák, Jan
9
2006
On the integrality ratio for the asymmetric traveling salesman problem. Zbl 1278.90328
Charikar, Moses; Goemans, Michel X.; Karloff, Howard
7
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
3
2006
Adaptivity and approximation for stochastic packing problems. Zbl 1297.90135
Dean, Brian C.; Goemans, Michel X.; Vondrák, Jan
17
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
36
2004
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1093.90038
Goemans, Michel X.; Williamson, David P.
18
2004
An approximate König’s theorem for edge-coloring weighted bipartite graphs. Zbl 1192.05046
Correa, José R.; Goemans, Michel X.
1
2004
Wide partitions, Latin tableaux, and Rota’s basis conjecture. Zbl 1029.05049
Chow, Timothy Y.; Fan, C. Kenneth; Goemans, Michel X.; Vondrak, Jan
3
2003
Improved approximation algorithms for minimum-space advertisement scheduling. Zbl 1039.68537
Dean, Brian C.; Goemans, Michel X.
1
2003
Single machine scheduling with release dates. Zbl 1009.90096
Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang
29
2002
When does the positive semidefiniteness constraint help in lifting procedures? Zbl 1082.90548
Goemans, Michel X.; Tunçel, Levent
19
2001
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. Zbl 1323.90047
Goemans, Michel X.; Williamson, David
5
2001
Combinatorial optimization. Zbl 0957.90514
Goemans, Michel; Rendl, Franz
13
2000
Cooperative facility location games. Zbl 0952.90021
Goemans, Michel X.; Skutella, Martin
10
2000
Two-dimensional Gantt charts and a scheduling algorithm of Lawler. Zbl 1054.90032
Goemans, Michel X.; Williamson, David P.
8
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.
22
1999
Semidefinite programs and association schemes. Zbl 0956.90029
Goemans, M. X.; Rendl, F.
8
1999
Improved bounds for on-line load balancing. Zbl 0916.68013
Andrews, M.; Goemans, M. X.; Zhang, L.
5
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.
28
1998
An improved approximation ratio for the minimum latency problem. Zbl 0920.90138
Goemans, Michel; Kleinberg, Jon
24
1998
The Lovász theta function and a semidefinite programming relaxation of vertex cover. Zbl 0910.90262
Kleinberg, Jon; Goemans, Michel X.
12
1998
Primal-dual approximation algorithms for feedback problems in planar graphs. Zbl 0928.90094
Goemans, Michel X.; Williamson, David P.
10
1998
An efficient approximation algorithm for the survivable network design problem. Zbl 0922.90140
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
7
1998
Semidefinite programming and combinatorial optimization. Zbl 0904.90129
Goemans, Michel X.
7
1998
Semidefinite programming in combinatorial optimization. Zbl 0887.90139
Goemans, Michel X.
48
1997
Improved approximation algorithms for scheduling with release dates. Zbl 1321.68502
Goemans, Michel X.
20
1997
An improved approximation ratio for the minimum latency problem. Zbl 0845.90122
Goemans, Michel; Kleinberg, Jon
13
1996
A supermodular relaxation for scheduling with release dates. Zbl 1414.90149
Goemans, Michel X.
7
1996
The strongest facets of the acyclic subgraph polytope are unknown. Zbl 1415.90135
Goemans, Michel X.; Hall, Leslie A.
4
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.
1
1996
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Zbl 0885.68088
Goemans, Michel X.; Williamson, David P.
504
1995
A general approximation technique for constrained forest problems. Zbl 0834.68055
Goemans, Michel X.; Williamson, David P.
131
1995
Worst-case comparison of valid inequalities for the TSP. Zbl 0844.90101
Goemans, Michel X.
32
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.
19
1995
Minimizing submodular functions over families of sets. Zbl 0840.90109
Goemans, M. X.; Ramakrishnan, V. S.
11
1995
An approximation algorithm for scheduling on three dedicated machines. Zbl 0831.68006
Goemans, Michel X.
9
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.
49
1994
New \(3\over4\)-approximation algorithms for the maximum satisfiability problem. Zbl 0812.90129
Goemans, Michel X.; Williamson, David P.
37
1994
.878-approximation algorithms for MAX CUT and MAX 2SAT. Zbl 1345.68274
Goemans, Michel X.; Williamson, David P.
28
1994
The Steiner tree polytope and related polyhedra. Zbl 0808.90124
Goemans, Michel X.
28
1994
Approximating minimum-cost graph problems with spanning tree edges. Zbl 0823.90125
Goemans, Michel X.; Williamson, David P.
6
1994
Arborescence polytopes for series-parallel graphs. Zbl 0802.05040
Goemans, Michel X.
6
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
52
1993
Survivable networks, linear programming relaxations and the parsimonious property. Zbl 0790.90072
Goemans, Michel X.; Bertsimas, Dimitris J.
41
1993
A catalog of Steiner tree formulations. Zbl 0794.90074
Goemans, Michel X.; Myung, Young-soo
33
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.
9
1993
An efficient approximation algorithm for the survivable network design problem. Zbl 0923.90136
Gabow, Harold N.; Goemans, Michel X.; Williamson, David P.
8
1993
A lower bound on the expected cost of an optimal assignment. Zbl 0779.90066
Goemans, Michel X.; Kodialam, Muralidharan S.
6
1993
A new \(\frac{3}{4}\)-approximation algorithm for \(\text{MAX SAT}\). Zbl 0929.90071
Goemans, Michel X.; Williamson, David P.
5
1993
A general approximation technique for constrained forest problems. Zbl 0818.90124
Goemans, Michel X.; Williamson, David P.
23
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.
11
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.
7
1990
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Zbl 0682.90068
Goemans, Michel X.
6
1989
all top 5

Cited by 2,056 Authors

30 Williamson, David P.
21 Xu, Dachuan
16 Goemans, Michel X.
15 Levin, Asaf
14 Nutov, Zeev
13 Nagarajan, Viswanath
12 Lisser, Abdel
12 Ravi, Ramamoorthi
12 Wu, Chenchen
11 Anjos, Miguel F.
11 Kortsarz, Guy
11 Pardalos, Panos M.
11 Rendl, Franz
10 Du, Donglei
10 Fiorini, Samuel
10 Maffioli, Francesco
10 Mastrolilli, Monaldo
10 Sitters, Rene A.
10 Tunçel, Levent
9 Ben-Ameur, Walid
9 Ljubić, Ivana
9 Shmoys, David B.
9 Xu, Chengxian
8 Bertsimas, Dimitris John
8 Epstein, Leah
8 Gupta, Anupam
8 Hajiaghayi, Mohammad Taghi
8 Laurent, Monique
8 Letchford, Adam N.
8 Ye, Yinyu
8 Zhang, Shuzhong
7 Gouveia, Luis
7 Könemann, Jochen
7 Kurpisz, Adam
7 Naor, Assaf
7 Pokutta, Sebastian
7 Skutella, Martin
7 Sviridenko, Maxim I.
7 Vazirani, Vijay V.
7 Xu, Fengmin
6 Chen, Xujin
6 Feige, Uriel
6 Fukunaga, Takuro
6 Haouari, Mohamed
6 Hassin, Refael
6 Kawarabayashi, Ken-ichi
6 Leppänen, Samuli
6 Li, Duan
6 Ling, Aifan
6 Mahjoub, Ali Ridha
6 Malick, Jérôme
6 Manthey, Bodo
6 Neto, José
6 Segev, Danny
6 Singer, Amit
6 Singh, Mohit
6 Swamy, Chaitanya
6 Tuza, Zsolt
6 van Zuylen, Anke
6 Xia, Yong
6 Zenklusen, Rico
6 Zhang, Jiawei
5 Arora, Sanjeev
5 Bazgan, Cristina
5 Bienstock, Daniel
5 Buchbinder, Niv
5 Burer, Samuel
5 Chakrabarty, Deeparnab
5 Chekuri, Chandra S.
5 Cornuéjols, Gérard P.
5 d’Aspremont, Alexandre
5 de Klerk, Etienne
5 Feldman, Moran
5 He, Simai
5 Hoefer, Martin
5 Kerivin, Hervé L. M.
5 Khandekar, Rohit
5 Kolliopoulos, Stavros G.
5 Krumke, Sven Oliver
5 Laporte, Gilbert
5 Lu, Cheng
5 Lucena, Abilio
5 Maehara, Takanori
5 Megow, Nicole
5 Parrilo, Pablo A.
5 Resende, Mauricio G. C.
5 Sanità, Laura
5 Sinnl, Markus
5 Stein, Clifford
5 Tu, Jianhua
5 van Ee, Martijn
5 Vempala, Santosh S.
5 Yu, Xingxing
4 Adasme, Pablo
4 Álvarez-Miranda, Eduardo
4 Arkin, Esther M.
4 Au, Yu-Hin
4 Bandeira, Afonso S.
4 Bateni, MohammadHossein
4 Bonami, Pierre
...and 1,956 more Authors
all top 5

Cited in 161 Serials

132 Mathematical Programming. Series A. Series B
91 Discrete Applied Mathematics
66 Theoretical Computer Science
61 Operations Research Letters
54 European Journal of Operational Research
53 Algorithmica
40 Journal of Combinatorial Optimization
34 Information Processing Letters
32 Journal of Global Optimization
28 Discrete Optimization
24 Computers & Operations Research
23 Journal of Computer and System Sciences
23 Mathematics of Operations Research
22 SIAM Journal on Computing
20 Networks
20 Optimization Methods & Software
19 SIAM Journal on Optimization
18 Annals of Operations Research
18 Optimization Letters
17 SIAM Journal on Discrete Mathematics
16 Computational Optimization and Applications
16 Theory of Computing Systems
13 Journal of Scheduling
11 Journal of Combinatorial Theory. Series B
11 Linear Algebra and its Applications
11 Cybernetics and Systems Analysis
11 RAIRO. Operations Research
10 Discrete Mathematics
10 Operations Research
9 Random Structures & Algorithms
8 Journal of Computational and Applied Mathematics
8 Journal of Optimization Theory and Applications
7 Artificial Intelligence
7 Journal of Discrete Algorithms
6 Applied Mathematics and Computation
6 Discrete & Computational Geometry
6 Asia-Pacific Journal of Operational Research
6 Games and Economic Behavior
6 Journal of Industrial and Management Optimization
6 Journal of the Operations Research Society of China
5 Israel Journal of Mathematics
5 Combinatorica
5 Information and Computation
5 International Transactions in Operational Research
5 Journal of Machine Learning Research (JMLR)
5 Mathematical Programming Computation
4 Automatica
4 Optimization
4 Applied Mathematical Modelling
4 Bulletin of the American Mathematical Society. New Series
4 Computational Complexity
4 Top
4 INFORMS Journal on Computing
4 Mathematical Problems in Engineering
4 Foundations of Computational Mathematics
4 Algorithms
4 Science China. Mathematics
3 The Annals of Statistics
3 Information Sciences
3 Journal of Combinatorial Theory. Series A
3 Acta Mathematicae Applicatae Sinica. English Series
3 Machine Learning
3 Numerical Algorithms
3 Applied and Computational Harmonic Analysis
3 International Journal of Computer Vision
3 Journal of the ACM
3 International Game Theory Review
3 Theory of Computing
3 Numerical Algebra, Control and Optimization
2 Communications on Pure and Applied Mathematics
2 Acta Mathematica
2 International Journal of Game Theory
2 Journal of Economic Theory
2 Naval Research Logistics
2 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods
2 Opsearch
2 European Journal of Combinatorics
2 Systems & Control Letters
2 Probability Theory and Related Fields
2 SIAM Journal on Matrix Analysis and Applications
2 Science in China. Series A
2 Neural Computation
2 Proceedings of the National Academy of Sciences of the United States of America
2 SIAM Review
2 Distributed Computing
2 Journal of Computer and Systems Sciences International
2 SIAM Journal on Scientific Computing
2 Applied Mathematics. Series B (English Edition)
2 Combinatorics, Probability and Computing
2 Annals of Mathematics and Artificial Intelligence
2 Annals of Mathematics. Second Series
2 CEJOR. Central European Journal of Operations Research
2 Nonlinear Analysis. Real World Applications
2 4OR
2 Computational Management Science
2 SIAM Journal on Imaging Sciences
2 Stochastic Systems
2 EURO Journal on Computational Optimization
1 Computer Methods in Applied Mechanics and Engineering
1 Indian Journal of Pure & Applied Mathematics
...and 61 more Serials
all top 5

Cited in 46 Fields

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

Citations by Year

Wikidata Timeline

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