×

zbMATH — the first resource for mathematics

Mahjoub, Ali Ridha

Compute Distance To:
Author ID: mahjoub.ali-ridha Recent zbMATH articles by "Mahjoub, Ali Ridha"
Published as: Mahjoub, A. Ridha; Mahjoub, Ali Ridha; Mahjoub, A. R.; Mahjoub, A.
Documents Indexed: 91 Publications since 1981, including 6 Books

Publications by Year

Citations contained in zbMATH Open

58 Publications have been cited 626 times in 361 Documents Cited by Year
On the cut polytope. Zbl 0616.90058
Barahona, Francisco; Mahjoub, Ali Ridha
142
1986
Design of survivable networks: a survey. Zbl 1072.90003
Kerivin, Hervé; Mahjoub, A. Ridha
54
2005
Facets of the bipartite subgraph polytope. Zbl 0578.05056
Barahona, Francisco; Grötschel, Martin; Mahjoub, Ali Ridha
36
1985
Two-edge connected spanning subgraphs and polyhedra. Zbl 0820.90117
Mahjoub, Ali Ridha
28
1994
Compositions of graphs and polyhedra. II: Stable sets. Zbl 0802.05068
Barahona, Francisco; Mahjoub, Ali Ridha
20
1994
The two-edge connected hop-constrained network design problem: valid inequalities and branch-and-cut. Zbl 1131.90065
Huygens, David; Labbé, Martine; Mahjoub, A. Ridha; Pesneau, Pierre
16
2007
On two-connected subgraph polytopes. Zbl 0838.05085
Barahona, Francisco; Mahjoub, Ali Ridha
15
1995
On the stable set polytope of a series-parallel graph. Zbl 0652.05029
Mahjoub, A. R.
15
1988
\(k\)-edge connected polyhedra on series-parallel graphs. Zbl 0865.90049
Biha, M. Didi; Mahjoub, A. R.
13
1996
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. Zbl 1085.90009
Fortz, B.; Mahjoub, A. R.; McCormick, S. T.; Pesneau, P.
13
2006
Two edge-disjoint hop-constrained paths and polyhedra. Zbl 1077.90010
Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre
13
2004
\(K_ i\)-covers. I: Complexity and polytopes. Zbl 0584.05052
Conforti, Michele; Corneil, Derek Gordon; Mahjoub, Ali Ridha
13
1986
On the dominating set polytope. Zbl 1168.05340
Bouchakour, M.; Contenza, T. M.; Lee, C. W.; Mahjoub, A. R.
12
2008
Compositions in the bipartite subgraph polytope. Zbl 0771.05092
Fonlupt, J.; Mahjoub, A. R.; Uhry, J. P.
12
1992
Separation of partition inequalities. Zbl 0977.90039
Baïou, Mourad; Barahona, Francisco; Mahjoub, Ali Ridha
11
2000
Compositions of graphs and polyhedra. I: Balanced induced subgraphs and acyclic subgraphs. Zbl 0802.05067
Barahona, Francisco; Mahjoub, Ali Ridha
11
1994
Facets of the balanced (acyclic) induced subgraph polytope. Zbl 0675.90071
Barahona, Francisco; Mahjoub, Ali Ridha
11
1989
Compositions of graphs and polyhedra. IV: Acyclic spanning subgraphs. Zbl 0802.05070
Barahona, Francisco; Fonlupt, Jean; Mahjoub, Ali Ridha
10
1994
Steiner 2-edge connected subgraph polytopes on series-parallel graphs. Zbl 0884.05083
Baïou, Mourad; Mahjoub, Ali Ridha
9
1997
\((1,2)\)-survivable networks: facets and branch-and-cut. Zbl 1095.90118
Kerivin, Hervé; Mahjoub, Ali Ridha; Nocq, Charles
9
2004
On the \(k\) edge-disjoint 2-hop-constrained paths polytope. Zbl 1152.90661
Dahl, Geir; Huygens, David; Mahjoub, A. Ridha; Pesneau, Pierre
9
2006
On perfectly two-edge connected graphs. Zbl 0882.90125
Mahjoub, Ali Ridha
8
1997
Hop-level flow formulation for the survivable network design with hop constraints problem. Zbl 1269.90023
Mahjoub, A. Ridha; Simonetti, Luidi; Uchoa, Eduardo
8
2013
Compositions of graphs and polyhedra. III: Graphs with no \(W_ 4\) minor. Zbl 0802.05069
Barahona, Francisco; Mahjoub, Ali Ridha
8
1994
Steiner \(k\)-edge connected subgraph polyhedra. Zbl 1031.90068
Biha, M. Didi; Mahjoub, A. R.
7
2000
On a composition of independence systems by circuit identification. Zbl 0759.05092
Euler, R.; Mahjoub, A. R.
7
1991
The \(k\) edge-disjoint 3-hop-constrained paths polytope. Zbl 1241.90155
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Mailfert, J.
7
2010
Steiner trees and polyhedra. Zbl 0994.90136
Didi Biha, M.; Kerivin, H.; Mahjoub, A. R.
6
2001
Critical extreme points of the 2-edge connected spanning subgraph polytope. Zbl 0948.90140
Fonlupt, Jean; Mahjoub, Ali Ridha
6
1999
One-node cutsets and the dominating set polytope. Zbl 0872.90104
Bouchakour, Mustapha; Mahjoub, Ali Ridha
6
1997
On survivable network polyhedra. Zbl 1079.90022
Kerivin, Hervé; Mahjoub, Ali Ridha
6
2005
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation. Zbl 1198.90072
Mahjoub, A. Ridha; McCormick, S. Thomas
6
2010
A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem. Zbl 1207.05192
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Biha, M. Didi; Mailfert, J.
5
2010
Critical extreme points of the 2-edge connected spanning subgraph polytope. Zbl 1085.90008
Fonlupt, Jean; Mahjoub, A. Ridha
5
2006
Integer programming formulations for the two 4-hop-constrained paths problem. Zbl 1180.90200
Huygens, David; Mahjoub, A. Ridha
5
2007
The maximum induced bipartite subgraph problem with edge weights. Zbl 1141.05076
Cornaz, Denis; Mahjoub, A. Ridha
5
2007
\(K_ i\)-covers. II. \(K_ i\)-perfect graphs. Zbl 0696.05042
Conforti, Michele; Corneil, Derek Gordon; Mahjoub, Ali Ridha
5
1987
Polytope des absorbants dans une classe de graphe à seuil. Zbl 0543.05050
Mahjoub, Ali Ridha
5
1983
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. Zbl 1038.05031
Didi Biha, M.; Mahjoub, A. R.
4
2004
On the NP-completeness of the perfect matching free subgraph problem. Zbl 1237.68089
Lacroix, Mathieu; Mahjoub, A. Ridha; Martin, Sébastien; Picouleau, Christophe
4
2012
Models for the single-vehicle preemptive pickup and delivery problem. Zbl 1242.90196
Kerivin, Hervé L. M.; Lacroix, Mathieu; Mahjoub, Ali Ridha
4
2012
Unsplittable non-additive capacitated network design using set functions polyhedra. Zbl 1349.90157
Benhamiche, Amal; Mahjoub, A. Ridha; Perrot, Nancy; Uchoa, Eduardo
4
2016
The vertex \(k\)-cut problem. Zbl 07065739
Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, A. Ridha; Martin, Sébastien
4
2019
The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut. Zbl 1405.05143
Cornaz, D.; Magnouche, Y.; Mahjoub, A. R.; Martin, S.
4
2019
Separation of partition inequalities for the \((1,2)\)-survivable network design problem. Zbl 1049.90010
Kerivin, Hervé; Mahjoub, Ali Ridha
3
2002
On the independent dominating set polytope. Zbl 1086.05057
Mahjoub, A. R.; Mailfert, J.
3
2006
The maximum cut problem. Zbl 1229.90151
Ben-Ameur, Walid; Mahjoub, Ali Ridha; Neto, José
3
2010
A strongly polynomial time algorithm for multicriteria global minimum cuts. Zbl 1418.90209
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice
2
2014
On the complexity of the Eulerian closed walk with precedence path constraints problem. Zbl 1274.90460
Kerivin, H. L. M.; Lacroix, M.; Mahjoub, A. R.
2
2010
Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Zbl 1346.90004
Cerulli, Raffaele (ed.); Fujishige, Satoru (ed.); Mahjoub, A. Ridha (ed.)
2
2016
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Zbl 1328.90131
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice
2
2015
On the polytope of the (1,2)-survivable network design problem. Zbl 1192.68025
Biha, Mohamed Didi; Kerivin, Hervé; Mahjoub, A. Ridha
2
2008
On the linear relaxation of the 2-node connected subgraph polytope. Zbl 0932.05087
Mahjoub, A. R.; Nocq, C.
1
1999
The Steiner traveling salesman polytope and related polyhedra. Zbl 1013.05071
Baïou, Mourad; Mahjoub, Ali Ridha
1
2002
Partition inequalities: separation, extensions, and network design. Zbl 1263.90108
Baïou, Mourad; Barahona, Francisco; Mahjoub, A. Ridha
1
2012
Generating facets for the independence system polytope. Zbl 1213.90179
Fouilhoux, Pierre; Labbé, Martine; Mahjoub, A. Ridha; Yaman, Hande
1
2009
Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Zbl 1248.90004
Mahjoub, A. Ridha (ed.); Markakis, Vangelis (ed.); Milis, Ioannis (ed.); Paschos, Vangelis Th. (ed.)
1
2012
Integer programming formulations for the \(k\)-edge-connected 3-hop-constrained network design problem. Zbl 1390.90104
Diarrassouba, I.; Gabrel, V.; Mahjoub, A. R.; Gouveia, L.; Pesneau, P.
1
2016
The vertex \(k\)-cut problem. Zbl 07065739
Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, A. Ridha; Martin, Sébastien
4
2019
The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut. Zbl 1405.05143
Cornaz, D.; Magnouche, Y.; Mahjoub, A. R.; Martin, S.
4
2019
Unsplittable non-additive capacitated network design using set functions polyhedra. Zbl 1349.90157
Benhamiche, Amal; Mahjoub, A. Ridha; Perrot, Nancy; Uchoa, Eduardo
4
2016
Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16–18, 2016. Revised selected papers. Zbl 1346.90004
Cerulli, Raffaele; Fujishige, Satoru; Mahjoub, A. Ridha
2
2016
Integer programming formulations for the \(k\)-edge-connected 3-hop-constrained network design problem. Zbl 1390.90104
Diarrassouba, I.; Gabrel, V.; Mahjoub, A. R.; Gouveia, L.; Pesneau, P.
1
2016
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Zbl 1328.90131
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice
2
2015
A strongly polynomial time algorithm for multicriteria global minimum cuts. Zbl 1418.90209
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice
2
2014
Hop-level flow formulation for the survivable network design with hop constraints problem. Zbl 1269.90023
Mahjoub, A. Ridha; Simonetti, Luidi; Uchoa, Eduardo
8
2013
On the NP-completeness of the perfect matching free subgraph problem. Zbl 1237.68089
Lacroix, Mathieu; Mahjoub, A. Ridha; Martin, Sébastien; Picouleau, Christophe
4
2012
Models for the single-vehicle preemptive pickup and delivery problem. Zbl 1242.90196
Kerivin, Hervé L. M.; Lacroix, Mathieu; Mahjoub, Ali Ridha
4
2012
Partition inequalities: separation, extensions, and network design. Zbl 1263.90108
Baïou, Mourad; Barahona, Francisco; Mahjoub, A. Ridha
1
2012
Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Zbl 1248.90004
Mahjoub, A. Ridha; Markakis, Vangelis; Milis, Ioannis; Paschos, Vangelis Th.
1
2012
The \(k\) edge-disjoint 3-hop-constrained paths polytope. Zbl 1241.90155
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Mailfert, J.
7
2010
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation. Zbl 1198.90072
Mahjoub, A. Ridha; McCormick, S. Thomas
6
2010
A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem. Zbl 1207.05192
Bendali, F.; Diarrassouba, I.; Mahjoub, A. R.; Biha, M. Didi; Mailfert, J.
5
2010
The maximum cut problem. Zbl 1229.90151
Ben-Ameur, Walid; Mahjoub, Ali Ridha; Neto, José
3
2010
On the complexity of the Eulerian closed walk with precedence path constraints problem. Zbl 1274.90460
Kerivin, H. L. M.; Lacroix, M.; Mahjoub, A. R.
2
2010
Generating facets for the independence system polytope. Zbl 1213.90179
Fouilhoux, Pierre; Labbé, Martine; Mahjoub, A. Ridha; Yaman, Hande
1
2009
On the dominating set polytope. Zbl 1168.05340
Bouchakour, M.; Contenza, T. M.; Lee, C. W.; Mahjoub, A. R.
12
2008
On the polytope of the (1,2)-survivable network design problem. Zbl 1192.68025
Biha, Mohamed Didi; Kerivin, Hervé; Mahjoub, A. Ridha
2
2008
The two-edge connected hop-constrained network design problem: valid inequalities and branch-and-cut. Zbl 1131.90065
Huygens, David; Labbé, Martine; Mahjoub, A. Ridha; Pesneau, Pierre
16
2007
Integer programming formulations for the two 4-hop-constrained paths problem. Zbl 1180.90200
Huygens, David; Mahjoub, A. Ridha
5
2007
The maximum induced bipartite subgraph problem with edge weights. Zbl 1141.05076
Cornaz, Denis; Mahjoub, A. Ridha
5
2007
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut. Zbl 1085.90009
Fortz, B.; Mahjoub, A. R.; McCormick, S. T.; Pesneau, P.
13
2006
On the \(k\) edge-disjoint 2-hop-constrained paths polytope. Zbl 1152.90661
Dahl, Geir; Huygens, David; Mahjoub, A. Ridha; Pesneau, Pierre
9
2006
Critical extreme points of the 2-edge connected spanning subgraph polytope. Zbl 1085.90008
Fonlupt, Jean; Mahjoub, A. Ridha
5
2006
On the independent dominating set polytope. Zbl 1086.05057
Mahjoub, A. R.; Mailfert, J.
3
2006
Design of survivable networks: a survey. Zbl 1072.90003
Kerivin, Hervé; Mahjoub, A. Ridha
54
2005
On survivable network polyhedra. Zbl 1079.90022
Kerivin, Hervé; Mahjoub, Ali Ridha
6
2005
Two edge-disjoint hop-constrained paths and polyhedra. Zbl 1077.90010
Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre
13
2004
\((1,2)\)-survivable networks: facets and branch-and-cut. Zbl 1095.90118
Kerivin, Hervé; Mahjoub, Ali Ridha; Nocq, Charles
9
2004
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. Zbl 1038.05031
Didi Biha, M.; Mahjoub, A. R.
4
2004
Separation of partition inequalities for the \((1,2)\)-survivable network design problem. Zbl 1049.90010
Kerivin, Hervé; Mahjoub, Ali Ridha
3
2002
The Steiner traveling salesman polytope and related polyhedra. Zbl 1013.05071
Baïou, Mourad; Mahjoub, Ali Ridha
1
2002
Steiner trees and polyhedra. Zbl 0994.90136
Didi Biha, M.; Kerivin, H.; Mahjoub, A. R.
6
2001
Separation of partition inequalities. Zbl 0977.90039
Baïou, Mourad; Barahona, Francisco; Mahjoub, Ali Ridha
11
2000
Steiner \(k\)-edge connected subgraph polyhedra. Zbl 1031.90068
Biha, M. Didi; Mahjoub, A. R.
7
2000
Critical extreme points of the 2-edge connected spanning subgraph polytope. Zbl 0948.90140
Fonlupt, Jean; Mahjoub, Ali Ridha
6
1999
On the linear relaxation of the 2-node connected subgraph polytope. Zbl 0932.05087
Mahjoub, A. R.; Nocq, C.
1
1999
Steiner 2-edge connected subgraph polytopes on series-parallel graphs. Zbl 0884.05083
Baïou, Mourad; Mahjoub, Ali Ridha
9
1997
On perfectly two-edge connected graphs. Zbl 0882.90125
Mahjoub, Ali Ridha
8
1997
One-node cutsets and the dominating set polytope. Zbl 0872.90104
Bouchakour, Mustapha; Mahjoub, Ali Ridha
6
1997
\(k\)-edge connected polyhedra on series-parallel graphs. Zbl 0865.90049
Biha, M. Didi; Mahjoub, A. R.
13
1996
On two-connected subgraph polytopes. Zbl 0838.05085
Barahona, Francisco; Mahjoub, Ali Ridha
15
1995
Two-edge connected spanning subgraphs and polyhedra. Zbl 0820.90117
Mahjoub, Ali Ridha
28
1994
Compositions of graphs and polyhedra. II: Stable sets. Zbl 0802.05068
Barahona, Francisco; Mahjoub, Ali Ridha
20
1994
Compositions of graphs and polyhedra. I: Balanced induced subgraphs and acyclic subgraphs. Zbl 0802.05067
Barahona, Francisco; Mahjoub, Ali Ridha
11
1994
Compositions of graphs and polyhedra. IV: Acyclic spanning subgraphs. Zbl 0802.05070
Barahona, Francisco; Fonlupt, Jean; Mahjoub, Ali Ridha
10
1994
Compositions of graphs and polyhedra. III: Graphs with no \(W_ 4\) minor. Zbl 0802.05069
Barahona, Francisco; Mahjoub, Ali Ridha
8
1994
Compositions in the bipartite subgraph polytope. Zbl 0771.05092
Fonlupt, J.; Mahjoub, A. R.; Uhry, J. P.
12
1992
On a composition of independence systems by circuit identification. Zbl 0759.05092
Euler, R.; Mahjoub, A. R.
7
1991
Facets of the balanced (acyclic) induced subgraph polytope. Zbl 0675.90071
Barahona, Francisco; Mahjoub, Ali Ridha
11
1989
On the stable set polytope of a series-parallel graph. Zbl 0652.05029
Mahjoub, A. R.
15
1988
\(K_ i\)-covers. II. \(K_ i\)-perfect graphs. Zbl 0696.05042
Conforti, Michele; Corneil, Derek Gordon; Mahjoub, Ali Ridha
5
1987
On the cut polytope. Zbl 0616.90058
Barahona, Francisco; Mahjoub, Ali Ridha
142
1986
\(K_ i\)-covers. I: Complexity and polytopes. Zbl 0584.05052
Conforti, Michele; Corneil, Derek Gordon; Mahjoub, Ali Ridha
13
1986
Facets of the bipartite subgraph polytope. Zbl 0578.05056
Barahona, Francisco; Grötschel, Martin; Mahjoub, Ali Ridha
36
1985
Polytope des absorbants dans une classe de graphe à seuil. Zbl 0543.05050
Mahjoub, Ali Ridha
5
1983
all top 5

Cited by 487 Authors

31 Mahjoub, Ali Ridha
18 Laurent, Monique
13 Letchford, Adam N.
12 Barahona, Francisco
11 Deza, Michel Marie
11 Poljak, Svatopluk
10 Kerivin, Hervé L. M.
9 Gouveia, Luis
9 Neto, José
7 Ben-Ameur, Walid
7 Lacroix, Mathieu
7 Leitner, Markus
7 Mailfert, Jean
7 Rinaldi, Giovanni
6 Bendali, Fatiha
6 Jünger, Michael
6 Liers, Frauke
6 Reinelt, Gerhard
6 Tolomei, Paola B.
5 Baïou, Mourad
5 De Simone, Caterina
5 Diarrassouba, Ibrahima
5 Fouilhoux, Pierre
5 Labbé, Martine V.
5 Ljubić, Ivana
5 Nasini, Graciela L.
5 Nguyen, Viet Hung
5 Salazar-González, Juan-José
5 Uchoa, Eduardo
4 Anjos, Miguel F.
4 Bianchi, Silvia M.
4 Bruhn, Henning
4 Conforti, Michele
4 Cornaz, Denis
4 de Souza, Cid Carvalho
4 Lodi, Andrea
4 Minoux, Michel Andre
4 Mutzel, Petra
4 Pesneau, Pierre
4 Rendl, Franz
4 Ridha Mahjoub, A.
4 Sassano, Antonio
4 Yaman, Hande
3 Chen, Xujin
3 Cheng, Eddie
3 Ding, Guoli
3 Escalante, Mariana S.
3 Figueiredo, Rosa M. V.
3 Fonlupt, Jean
3 Fortz, Bernard
3 Galli, Laura
3 Goemans, Michel X.
3 Grappe, Roland
3 Kalinowski, Thomas
3 Kaparis, Konstantinos
3 Marín, Alfredo
3 Martin, Alexander
3 Mehrotra, Anuj
3 Nguyen, Dang Phuong
3 Rodríguez-Martín, Inmaculada
3 Simonetti, Luidi G.
3 Sørensen, Michael Malmros
3 Zang, Wenan
2 Akgün, İbrahim
2 Ales, Zacharie
2 Argiroffo, Gabriela R.
2 Balasundaram, Balabhaskar
2 Boginski, Vladimir L.
2 Bondarenko, V. A.
2 Borne, Sylvie
2 Boros, Endre
2 Bouchakour, Mustapha
2 Caprara, Alberto
2 Carroll, Paula
2 Chopra, Sunil
2 Cook, William John
2 Corneil, Derek Gordon
2 Del Pia, Alberto
2 Dell’Amico, Mauro
2 Delorme, Charles
2 Dutour-Sikiric, Mathieu
2 Feremans, Corinne
2 Ferreira, Carlos Eduardo
2 Fiorini, Samuel
2 Frota, Yuri A.
2 Galluccio, Anna
2 Gentile, Claudio
2 Grötschel, Martin
2 Günlük, Oktay
2 Hammer, Peter Ladislaw
2 Hungerländer, Philipp
2 Huygens, David
2 Karasan, Oya Ekin
2 Khajavirad, Aida
2 Kleinert, Thomas
2 Knippel, Arnaud
2 Kolman, Petr
2 Kutucu, Hakan
2 Landete, Mercedes
2 Laporte, Gilbert
...and 387 more Authors
all top 5

Cited in 58 Serials

45 Mathematical Programming. Series A. Series B
40 Discrete Applied Mathematics
25 Discrete Mathematics
25 Operations Research Letters
23 Discrete Optimization
16 European Journal of Operational Research
12 Networks
10 Computers & Operations Research
10 Journal of Combinatorial Optimization
9 Linear Algebra and its Applications
8 RAIRO. Operations Research
7 Computational Optimization and Applications
7 Mathematical Programming Computation
6 Theoretical Computer Science
5 Journal of Combinatorial Theory. Series B
5 European Journal of Combinatorics
5 Graphs and Combinatorics
5 Annals of Operations Research
5 Optimization Letters
4 SIAM Journal on Discrete Mathematics
4 Cybernetics and Systems Analysis
4 International Transactions in Operational Research
3 INFORMS Journal on Computing
3 Journal of Graph Algorithms and Applications
2 Information Processing Letters
2 Journal of Computational and Applied Mathematics
2 Algorithmica
2 Random Structures & Algorithms
2 Journal of Global Optimization
2 SIAM Journal on Optimization
2 Mathematical Methods of Operations Research
2 Networks and Spatial Economics
1 Journal of Mathematical Physics
1 Journal of Statistical Physics
1 Annals of the Institute of Statistical Mathematics
1 International Journal of Mathematics and Mathematical Sciences
1 Journal of Mathematical Economics
1 Journal of Pure and Applied Algebra
1 Mathematical Programming
1 Operations Research
1 Results in Mathematics
1 SIAM Journal on Computing
1 Statistica Neerlandica
1 Tohoku Mathematical Journal. Second Series
1 International Journal of Computational Geometry & Applications
1 Discrete Mathematics and Applications
1 Games and Economic Behavior
1 YUJOR. Yugoslav Journal of Operations Research
1 International Journal of Computer Vision
1 Journal of Heuristics
1 Doklady Mathematics
1 Optimization Methods & Software
1 Optimization and Engineering
1 4OR
1 Computational Management Science
1 Advances in Operations Research
1 EURO Journal on Computational Optimization
1 Computer Science Review

Citations by Year