-> Articles -> Conferences
Publications - Articles
Authors :Mourad Baïou and Francisco Barahona
"Network disconnection games: A game theoretic approach to checkpoint evaluation in networks"
Discret. Appl. Math. 308, 198--208
Date :2022 Authors :Mourad Baïou and Rafael Colares and Hervé Kerivin "The complexity of the unit stop number problem and its implications to other related problems" Theor. Comput. Sci. 919, 36--46
Date :2022 Authors :Rui Sa Shibasaki and Mourad Baïou and Francisco Barahona and Philippe Mahey and Mauricio C. de Souza "Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods" Int. Trans. Oper. Res. 28, 296--326
Date :2021 Authors :Mourad Baïou and Francisco Barahona "Network strength games: the core and the nucleolus" Math. Program. 180, 117--136
Date :2020 Authors :Mourad Baïou and Francisco Barahona "Faster Algorithms for Security Games on Matroids" Algorithmica 81, 1232--1246
Date :2019 Authors :Mourad Baïou and Francisco Barahona "An Algorithm to Compute the Nucleolus of Shortest Path Games" Algorithmica 81, 3099--3113
Date :2019 Authors :Abdeslem Belghoul and Mourad Baïou and Farouk Toumani "{MIND:} An approach to optimize communication time via middleware tuning" Inf. Syst. 82, 17--32
Date :2019 Authors :Méziane Aïder and Lamia Aoudia and Mourad Baïou and Ali Ridha Mahjoub and Viet Hung Nguyen "On the star forest polytope for trees and cycles" RAIRO Oper. Res. 53, 1763--1773
Date :2019 Authors :Mourad Baïou and Francisco Barahona "Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem" Math. Program. 172, 59--75
Date :2018 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope and the odd directed cycle inequalities: Oriented graphs" Networks 71, 326--345
Date :2018 Authors :Henri Perret du Cray and Mourad Baïou and Laurent Beaudou and Vincent Limouzy "Bounds on Directed star arboricity in some digraph classes" Electron. Notes Discret. Math. 62, 267--272
Date :2017 Authors :Mourad Baïou and Francisco Barahona "Stackelberg Bipartite Vertex Cover and the Preflow Algorithm" Algorithmica 74, 1174--1183
Date :2016 Authors :Mourad Baïou "A note on many-to-many matchings and stable allocations" Discret. Appl. Math. 202, 181--184
Date :2016 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs" Discret. Optim. 22, 206--224
Date :2016 Authors :Mourad Baïou and Michel Habib and Lhouari Nourine "Preface" RAIRO Oper. Res. 50, 221--222
Date :2016 Authors :Mourad Baïou and Francisco Barahona "Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs" SIAM J. Discret. Math. 30, 1290--1301
Date :2016 Authors :Mourad Baïou and Francisco Barahona "On a connection between facility location and perfect graphs" Oper. Res. Lett. 42, 466--472
Date :2014 Authors :Mourad Baïou and Francisco Barahona "A polyhedral study of a two level facility location model" RAIRO Oper. Res. 48, 153--165
Date :2014 Authors :Mourad Baïou and Laurent Beaudou and Zhentao Li and Vincent Limouzy "On a class of intersection graphs" CoRR abs/1306.2498
Date :2013 Authors :Mourad Baïou and Francisco Barahona "On the linear relaxation of the p-median problem" Discret. Optim. 8, 344--375
Date :2011 Authors :Mourad Baïou and Francisco Barahona and José R. Correa "On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms" SIAM J. Discret. Math. 25, 1--20
Date :2011 Authors :Mourad Baïou and Francisco Barahona and José R. Correa "On the p-median polytope of fork-free graphs" Electron. Notes Discret. Math. 36, 143--149
Date :2010 Authors :Mourad Baïou and Francisco Barahona "On the Integrality of Some Facility Location Polytopes" SIAM J. Discret. Math. 23, 665--679
Date :2009 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope of Y-free graphs" Discret. Optim. 5, 205--219
Date :2008 Authors :Mourad Baïou and Francisco Barahona "A linear programming approach to increasing the weight of all minimum spanning trees" Networks 52, 227--234
Date :2008 Authors :Mourad Baïou and Michel Balinski "Characterizations of the optimal stable allocation mechanism" Oper. Res. Lett. 35, 392--402
Date :2007 Authors :Mourad Baïou and José R. Correa "The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation" Discret. Optim. 3, 123--135
Date :2006 Authors :Mourad Baïou and José R. Correa "The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation" Electron. Notes Discret. Math. 19, 103--109
Date :2005 Authors :Mourad Baïou and Michel Balinski "Student admissions and faculty recruitment" Theor. Comput. Sci. 322, 245--265
Date :2004 Authors :Mourad Baïou and Michel Balinski "Admissions and Recruitment" Am. Math. Mon. 110, 386--399
Date :2003 Authors :Mourad Baïou and Michel Balinski "The Stable Allocation (or Ordinal Transportation) Problem" Math. Oper. Res. 27, 485--503
Date :2002 Authors :Mourad Baïou and Michel Balinski "Erratum: The Stable Allocation (or Ordinal Transportation) Problem" Math. Oper. Res. 27, 662--680
Date :2002 Authors :Mourad Baïou and Ali Ridha Mahjoub "The Steiner Traveling Salesman Polytope and Related Polyhedra" SIAM J. Optim. 13, 498--507
Date :2002 Authors :Mourad Baïou "On the dominant of the Steiner 2-edge connected subgraph polytope" Discret. Appl. Math. 112, 3--10
Date :2001 Authors :Mourad Baïou and Michel Balinski "Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)" Discret. Appl. Math. 101, 1--12
Date :2000 Authors :Mourad Baïou and Francisco Barahona and Ali Ridha Mahjoub "Separation of Partition Inequalities" Math. Oper. Res. 25, 243--254
Date :2000 Authors :Mourad Baïou and Michel Balinski "The stable admissions polytope" Math. Program. 87, 427--439
Date :2000 Authors :Mourad Baïou and Ali Ridha Mahjoub "Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs" SIAM J. Discret. Math. 10, 505--514
Date :1997
Date :2022 Authors :Mourad Baïou and Rafael Colares and Hervé Kerivin "The complexity of the unit stop number problem and its implications to other related problems" Theor. Comput. Sci. 919, 36--46
Date :2022 Authors :Rui Sa Shibasaki and Mourad Baïou and Francisco Barahona and Philippe Mahey and Mauricio C. de Souza "Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods" Int. Trans. Oper. Res. 28, 296--326
Date :2021 Authors :Mourad Baïou and Francisco Barahona "Network strength games: the core and the nucleolus" Math. Program. 180, 117--136
Date :2020 Authors :Mourad Baïou and Francisco Barahona "Faster Algorithms for Security Games on Matroids" Algorithmica 81, 1232--1246
Date :2019 Authors :Mourad Baïou and Francisco Barahona "An Algorithm to Compute the Nucleolus of Shortest Path Games" Algorithmica 81, 3099--3113
Date :2019 Authors :Abdeslem Belghoul and Mourad Baïou and Farouk Toumani "{MIND:} An approach to optimize communication time via middleware tuning" Inf. Syst. 82, 17--32
Date :2019 Authors :Méziane Aïder and Lamia Aoudia and Mourad Baïou and Ali Ridha Mahjoub and Viet Hung Nguyen "On the star forest polytope for trees and cycles" RAIRO Oper. Res. 53, 1763--1773
Date :2019 Authors :Mourad Baïou and Francisco Barahona "Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem" Math. Program. 172, 59--75
Date :2018 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope and the odd directed cycle inequalities: Oriented graphs" Networks 71, 326--345
Date :2018 Authors :Henri Perret du Cray and Mourad Baïou and Laurent Beaudou and Vincent Limouzy "Bounds on Directed star arboricity in some digraph classes" Electron. Notes Discret. Math. 62, 267--272
Date :2017 Authors :Mourad Baïou and Francisco Barahona "Stackelberg Bipartite Vertex Cover and the Preflow Algorithm" Algorithmica 74, 1174--1183
Date :2016 Authors :Mourad Baïou "A note on many-to-many matchings and stable allocations" Discret. Appl. Math. 202, 181--184
Date :2016 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs" Discret. Optim. 22, 206--224
Date :2016 Authors :Mourad Baïou and Michel Habib and Lhouari Nourine "Preface" RAIRO Oper. Res. 50, 221--222
Date :2016 Authors :Mourad Baïou and Francisco Barahona "Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs" SIAM J. Discret. Math. 30, 1290--1301
Date :2016 Authors :Mourad Baïou and Francisco Barahona "On a connection between facility location and perfect graphs" Oper. Res. Lett. 42, 466--472
Date :2014 Authors :Mourad Baïou and Francisco Barahona "A polyhedral study of a two level facility location model" RAIRO Oper. Res. 48, 153--165
Date :2014 Authors :Mourad Baïou and Laurent Beaudou and Zhentao Li and Vincent Limouzy "On a class of intersection graphs" CoRR abs/1306.2498
Date :2013 Authors :Mourad Baïou and Francisco Barahona "On the linear relaxation of the p-median problem" Discret. Optim. 8, 344--375
Date :2011 Authors :Mourad Baïou and Francisco Barahona and José R. Correa "On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms" SIAM J. Discret. Math. 25, 1--20
Date :2011 Authors :Mourad Baïou and Francisco Barahona and José R. Correa "On the p-median polytope of fork-free graphs" Electron. Notes Discret. Math. 36, 143--149
Date :2010 Authors :Mourad Baïou and Francisco Barahona "On the Integrality of Some Facility Location Polytopes" SIAM J. Discret. Math. 23, 665--679
Date :2009 Authors :Mourad Baïou and Francisco Barahona "On the p-median polytope of Y-free graphs" Discret. Optim. 5, 205--219
Date :2008 Authors :Mourad Baïou and Francisco Barahona "A linear programming approach to increasing the weight of all minimum spanning trees" Networks 52, 227--234
Date :2008 Authors :Mourad Baïou and Michel Balinski "Characterizations of the optimal stable allocation mechanism" Oper. Res. Lett. 35, 392--402
Date :2007 Authors :Mourad Baïou and José R. Correa "The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation" Discret. Optim. 3, 123--135
Date :2006 Authors :Mourad Baïou and José R. Correa "The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation" Electron. Notes Discret. Math. 19, 103--109
Date :2005 Authors :Mourad Baïou and Michel Balinski "Student admissions and faculty recruitment" Theor. Comput. Sci. 322, 245--265
Date :2004 Authors :Mourad Baïou and Michel Balinski "Admissions and Recruitment" Am. Math. Mon. 110, 386--399
Date :2003 Authors :Mourad Baïou and Michel Balinski "The Stable Allocation (or Ordinal Transportation) Problem" Math. Oper. Res. 27, 485--503
Date :2002 Authors :Mourad Baïou and Michel Balinski "Erratum: The Stable Allocation (or Ordinal Transportation) Problem" Math. Oper. Res. 27, 662--680
Date :2002 Authors :Mourad Baïou and Ali Ridha Mahjoub "The Steiner Traveling Salesman Polytope and Related Polyhedra" SIAM J. Optim. 13, 498--507
Date :2002 Authors :Mourad Baïou "On the dominant of the Steiner 2-edge connected subgraph polytope" Discret. Appl. Math. 112, 3--10
Date :2001 Authors :Mourad Baïou and Michel Balinski "Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)" Discret. Appl. Math. 101, 1--12
Date :2000 Authors :Mourad Baïou and Francisco Barahona and Ali Ridha Mahjoub "Separation of Partition Inequalities" Math. Oper. Res. 25, 243--254
Date :2000 Authors :Mourad Baïou and Michel Balinski "The stable admissions polytope" Math. Program. 87, 427--439
Date :2000 Authors :Mourad Baïou and Ali Ridha Mahjoub "Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs" SIAM J. Discret. Math. 10, 505--514
Date :1997
Publications - Conferences
Authors :Aurelien Mombelli and A. Olivas Gonzales and Mourad Baïou and Alain Quilliot
"Safe Management of Autonomous Vehicles"
CoDIT 693--698
Date :2022 Authors :Aurelien Mombelli and Alain Quilliot and Mourad Baïou Editor :Federico Liberatore and Greg H. Parlier and Marc Demange "Searching for a Safe Shortest Path in a Warehouse" ICORES 115--122
Date :2022 Authors :Minh Hieu Nguyen and Viet Hung Nguyen and Thi Quynh Trang Vo and Mourad Baïou Editor :Christina Büsing and Arie M. C. A. Koster "Nash fairness solutions for balanced TSP" INOC 1--6
Date :2022 Authors :Mourad Baïou and Alain Quilliot and Lounis Adouane and Aurelien Mombelli and Zhengze Zhu Editor :Maria Ganzha and Leszek A. Maciaszek and Marcin Paprzycki and Dominik Slezak "Algorithms for the Safe Management of Autonomous Vehicles" FedCSIS 153--162
Date :2021 Authors :Mourad Baïou and Francisco Barahona Editor :Mourad Baïou and Bernard Gendron and Oktay Günlük and Ali Ridha Mahjoub "On the p-Median Polytope and the Directed Odd Cycle Inequalities" Discrete Optimization 22, 206--224
Date :2020 Authors :Mourad Baïou and Rafael Colares and Hervé Kerivin Editor :Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub "The Stop Number Minimization Problem: Complexity and Polyhedral Analysis" ISCO 64--76
Date :2018 Authors :Mourad Baïou and Francisco Barahona Editor :Vittorio Bilo and Michele Flammini "On the Nucleolus of Shortest Path Games" SAGT 10504, 55--66
Date :2017 Authors :Mourad Baïou and Francisco Barahona Editor :Quentin Louveaux and Martin Skutella "Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem" IPCO 9682, 63--76
Date :2016 Authors :Mourad Baïou and Francisco Barahona Editor :Jon Lee and Jens Vygen "Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs" IPCO 8494, 88--101
Date :2014 Authors :Mourad Baïou and Francisco Barahona Editor :Pierre Fouilhoux and Luis Eduardo Neves Gouveia and Ali Ridha Mahjoub and Vangelis Th. Paschos "The Dominating Set Polytope via Facility Location" ISCO 8596, 38--49
Date :2014 Authors :Mourad Baïou and Laurent Beaudou and Zhentao Li and Vincent Limouzy Editor :Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam "Hardness and Algorithms for Variants of Line Graphs of Directed Graphs" ISAAC 8283, 196--206
Date :2013 Authors :Mourad Baïou and Francisco Barahona Editor :William J. Cook and Laszlo Lovasz and Jens Vygen "On the Location and p-Median Polytopes" Bonn verlag1--31
Date :2008
Date :2022 Authors :Aurelien Mombelli and Alain Quilliot and Mourad Baïou Editor :Federico Liberatore and Greg H. Parlier and Marc Demange "Searching for a Safe Shortest Path in a Warehouse" ICORES 115--122
Date :2022 Authors :Minh Hieu Nguyen and Viet Hung Nguyen and Thi Quynh Trang Vo and Mourad Baïou Editor :Christina Büsing and Arie M. C. A. Koster "Nash fairness solutions for balanced TSP" INOC 1--6
Date :2022 Authors :Mourad Baïou and Alain Quilliot and Lounis Adouane and Aurelien Mombelli and Zhengze Zhu Editor :Maria Ganzha and Leszek A. Maciaszek and Marcin Paprzycki and Dominik Slezak "Algorithms for the Safe Management of Autonomous Vehicles" FedCSIS 153--162
Date :2021 Authors :Mourad Baïou and Francisco Barahona Editor :Mourad Baïou and Bernard Gendron and Oktay Günlük and Ali Ridha Mahjoub "On the p-Median Polytope and the Directed Odd Cycle Inequalities" Discrete Optimization 22, 206--224
Date :2020 Authors :Mourad Baïou and Rafael Colares and Hervé Kerivin Editor :Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub "The Stop Number Minimization Problem: Complexity and Polyhedral Analysis" ISCO 64--76
Date :2018 Authors :Mourad Baïou and Francisco Barahona Editor :Vittorio Bilo and Michele Flammini "On the Nucleolus of Shortest Path Games" SAGT 10504, 55--66
Date :2017 Authors :Mourad Baïou and Francisco Barahona Editor :Quentin Louveaux and Martin Skutella "Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem" IPCO 9682, 63--76
Date :2016 Authors :Mourad Baïou and Francisco Barahona Editor :Jon Lee and Jens Vygen "Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs" IPCO 8494, 88--101
Date :2014 Authors :Mourad Baïou and Francisco Barahona Editor :Pierre Fouilhoux and Luis Eduardo Neves Gouveia and Ali Ridha Mahjoub and Vangelis Th. Paschos "The Dominating Set Polytope via Facility Location" ISCO 8596, 38--49
Date :2014 Authors :Mourad Baïou and Laurent Beaudou and Zhentao Li and Vincent Limouzy Editor :Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam "Hardness and Algorithms for Variants of Line Graphs of Directed Graphs" ISAAC 8283, 196--206
Date :2013 Authors :Mourad Baïou and Francisco Barahona Editor :William J. Cook and Laszlo Lovasz and Jens Vygen "On the Location and p-Median Polytopes" Bonn verlag1--31
Date :2008