( en | de | ru )

 

Disambiguation of "Mahjoub, Ali Ridha"

Author of the publication

copydeleteadd this publication to your clipboard
Critical extreme points of the 2-edge connected spanning subgraph polytope.

, and . Math. Program., 105 (2-3): 289-310 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fadhil Ridha Ali

Zaher Mahjoub

Alireza Mahjoub

Ridha Asfahani

Ridha Ziani

 

Other publications of authors with the same name

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem., , , , and . Networks, 67 (2): 148-169 (2016)Preface: New trends on combinatorial optimization for network and logistical applications., , and . Ann. Oper. Res., 298 (1): 1-5 (2021)On the complexity of the Eulerian closed walk with precedence path constraints problem., , and . Theor. Comput. Sci., (2012)Generating Facets for the Independence System Polytope., , , and . SIAM J. Discret. Math., 23 (3): 1484-1506 (2009)On the k edge-disjoint 2-hop-constrained paths polytope., , , and . Oper. Res. Lett., 34 (5): 577-582 (2006)Integer programming formulations for the two 4-hop-constrained paths problem., and . Networks, 49 (2): 135-144 (2007)On the stable set polytope of a series-parallel graph.. Math. Program., 40 (1-3): 53-57 (1988)On the dominating set polytope., , , and . Eur. J. Comb., 29 (3): 652-661 (2008)Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut., , , and . Comput. Ind. Eng., (October 2023)The k edge-disjoint 3-hop-constrained paths polytope., , , and . Discret. Optim., 7 (4): 222-233 (2010)