Urmăriți
A. Ridha Mahjoub
A. Ridha Mahjoub
Professor of Operations Research, Université Paris-Dauphine
Adresă de e-mail confirmată pe lamsade.dauphine.fr
Titlu
Citat de
Citat de
Anul
On the cut polytope
F Barahona, AR Mahjoub
Mathematical programming 36, 157-173, 1986
5751986
Design of survivable networks: A survey
H Kerivin, AR Mahjoub
Networks: An International Journal 46 (1), 1-21, 2005
3182005
Facets of the bipartite subgraph polytope
F Barahona, M Grötschel, AR Mahjoub
Mathematics of Operations Research 10 (2), 340-358, 1985
1081985
Two-edge connected spanning subgraphs and polyhedra
AR Mahjoub
Mathematical Programming 64 (1), 199-208, 1994
1001994
Compositions of graphs and polyhedra II: stable sets
F Barahona, AR Mahjoub
SIAM Journal on Discrete Mathematics 7 (3), 359-371, 1994
781994
On two-connected subgraph polytopes
F Barahona, AR Mahjoub
Discrete Mathematics 147 (1-3), 19-34, 1995
671995
Two edge-disjoint hop-constrained paths and polyhedra
D Huygens, AR Mahjoub, P Pesneau
SIAM Journal on Discrete Mathematics 18 (2), 287-312, 2004
652004
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval
I Kacem, AR Mahjoub
Computers & Industrial Engineering 56 (4), 1708-1712, 2009
632009
The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut
D Huygens, M Labbé, AR Mahjoub, P Pesneau
Networks: An International Journal 49 (1), 116-133, 2007
602007
Steiner 2-edge connected subgraph polytopes on series-parallel graphs
M Baïou, AR Mahjoub
SIAM Journal on Discrete Mathematics 10 (3), 505-514, 1997
561997
On the stable set polytope of a series-parallel graph
AR Mahjoub
Mathematical Programming 40 (1), 53-57, 1988
561988
The splittable pickup and delivery problem with reloads
HLM Kerivin, M Lacroix, AR Mahjoub, A Quilliot
European Journal of Industrial Engineering 2 (2), 112-133, 2008
522008
A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing
O Arslan, OE Karașan, AR Mahjoub, H Yaman
Transportation Science 53 (4), 1107-1125, 2019
502019
Separation of partition inequalities
M Baïou, F Barahona, AR Mahjoub
Mathematics of Operations Research 25 (2), 243-254, 2000
482000
Design of survivable IP-over-optical networks
S Borne, E Gourdin, B Liau, AR Mahjoub
Annals of Operations Research 146, 41-73, 2006
472006
Compositions of Graphs and Polyhedra III: Graphs with No Minor
F Barahona, AR Mahjoub
SIAM Journal on Discrete Mathematics 7 (3), 372-389, 1994
431994
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
AR Mahjoub, ST McCormick
Mathematical programming 124, 271-284, 2010
412010
On the k edge-disjoint 2-hop-constrained paths polytope
G Dahl, D Huygens, AR Mahjoub, P Pesneau
Operations research letters 34 (5), 577-582, 2006
392006
Critical extreme points of the 2-edge connected spanning subgraph polytope
J Fonlupt, AR Mahjoub
Mathematical programming 105, 289-310, 2006
39*2006
Solving VLSI design and DNA sequencing problems using bipartization of graphs
P Fouilhoux, AR Mahjoub
Computational Optimization and Applications 51, 749-781, 2012
372012
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20