Mourad Baïou

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 39

Top Topics

Facility Location

Traveling Salesman Problem

Top Venues

RAIRO Oper. Res.

Discret. Appl. Math.

Publications

Mourad Baïou, José R. Correa, Rida Laraki
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. Math. Program. 203 (1) (2024)
Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo
Generalized nash fairness solutions for bi-objective minimization problems. Networks 83 (1) (2024)
Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen
A branch-and-cut algorithm for the balanced traveling salesman problem. J. Comb. Optim. 47 (2) (2024)
José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. Discret. Appl. Math. 356 (2024)
Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo
Proportional Fairness for Combinatorial Optimization. LATIN (2) (2024)
Mourad Baïou, Francisco Barahona
On some algorithmic aspects of hypergraphic matroids. Discret. Math. 346 (2) (2023)
Mourad Baïou, Rafael Colares, Hervé Kerivin
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. Eur. J. Oper. Res. 310 (2) (2023)
Aurélien Mombelli, Alain Quilliot, Mourad Baïou
A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem. ICORES (2023)
Aurélien Mombelli, Alain Quilliot, Mourad Baïou
Multiple Heuristics with Reinforcement Learning to Solve the Safe Shortest Path Problem in a Warehouse. ICORES (Selected Papers) (2023)
Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning. LION (2023)
Aurelien Mombelli, Alain Quilliot, Mourad Baïou
Searching for a Safe Shortest Path in a Warehouse. ICORES (2022)
Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen
Nash Balanced Assignment Problem. ISCO (2022)
Mourad Baïou, Rafael Colares, Hervé Kerivin
The complexity of the unit stop number problem and its implications to other related problems. Theor. Comput. Sci. 919 (2022)
José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. ISCO (2022)
Mourad Baïou, Francisco Barahona
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. Discret. Appl. Math. 308 (2022)
Mourad Baïou, Francisco Barahona
Packing Hypertrees and the k-cut Problem in Hypergraphs. LION (2022)
Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng
A comparative study of linearization methods for Ordered Weighted Average. RNDM (2022)
Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou
Nash fairness solutions for balanced TSP. INOC (2022)
Aurelien Mombelli, A. Olivas Gonzales, Mourad Baïou, Alain Quilliot
Safe Management of Autonomous Vehicles. CoDIT (2022)
Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR (2022)
Rui Sa Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28 (1) (2021)
Mourad Baïou, Alain Quilliot, Lounis Adouane, Aurelien Mombelli, Zhengze Zhu
Algorithms for the Safe Management of Autonomous Vehicles. FedCSIS (2021)
Mourad Baïou, Francisco Barahona
On the p-Median Polytope and the Directed Odd Cycle Inequalities. ISCO (2020)
Mourad Baïou, Francisco Barahona
Network strength games: the core and the nucleolus. Math. Program. 180 (1) (2020)
Abdeslem Belghoul, Mourad Baïou, Farouk Toumani
MIND: An approach to optimize communication time via middleware tuning. Inf. Syst. 82 (2019)
Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen
On the star forest polytope for trees and cycles. RAIRO Oper. Res. 53 (5) (2019)
Mourad Baïou, Francisco Barahona
An Algorithm to Compute the Nucleolus of Shortest Path Games. Algorithmica 81 (8) (2019)
Mourad Baïou, Francisco Barahona
Faster Algorithms for Security Games on Matroids. Algorithmica 81 (3) (2019)
Mourad Baïou, Francisco Barahona
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Math. Program. 172 (1-2) (2018)
Mourad Baïou, Francisco Barahona
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. Networks 71 (4) (2018)
Mourad Baïou, Rafael Colares, Hervé Kerivin
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. ISCO (2018)
Mourad Baïou, Francisco Barahona
On the Nucleolus of Shortest Path Games. SAGT (2017)
Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy
Bounds on Directed star arboricity in some digraph classes. Electron. Notes Discret. Math. 62 (2017)
Mourad Baïou, Francisco Barahona
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. IPCO (2016)
Mourad Baïou
A note on many-to-many matchings and stable allocations. Discret. Appl. Math. 202 (2016)
Mourad Baïou, Francisco Barahona
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. Algorithmica 74 (3) (2016)
Mourad Baïou, Michel Habib, Lhouari Nourine
Preface. RAIRO Oper. Res. 50 (2) (2016)
Mourad Baïou, Francisco Barahona
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. SIAM J. Discret. Math. 30 (2) (2016)
Mourad Baïou, Francisco Barahona
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. Discret. Optim. 22 (2016)
Mourad Baïou, Francisco Barahona
On a connection between facility location and perfect graphs. Oper. Res. Lett. 42 (6-7) (2014)
Mourad Baïou, Francisco Barahona
The Dominating Set Polytope via Facility Location. ISCO (2014)
Mourad Baïou, Francisco Barahona
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. IPCO (2014)
Mourad Baïou, Francisco Barahona
A polyhedral study of a two level facility location model. RAIRO Oper. Res. 48 (2) (2014)
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. ISAAC (2013)
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
On a class of intersection graphs. CoRR (2013)
Mourad Baïou, Francisco Barahona
On the linear relaxation of the p-median problem. Discret. Optim. 8 (2) (2011)
Mourad Baïou, Francisco Barahona, José R. Correa
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discret. Math. 25 (1) (2011)
Mourad Baïou, Francisco Barahona, José R. Correa
On the p-median polytope of fork-free graphs. Electron. Notes Discret. Math. 36 (2010)
Mourad Baïou, Francisco Barahona
On the Integrality of Some Facility Location Polytopes. SIAM J. Discret. Math. 23 (2) (2009)
Mourad Baïou, Francisco Barahona
On the p-median polytope of Y-free graphs. Discret. Optim. 5 (2) (2008)
Mourad Baïou, Francisco Barahona
-Median Polytopes. Bonn Workshop of Combinatorial Optimization (2008)
Mourad Baïou, Francisco Barahona
A linear programming approach to increasing the weight of all minimum spanning trees. Networks 52 (4) (2008)
Mourad Baïou, Michel Balinski
Characterizations of the optimal stable allocation mechanism. Oper. Res. Lett. 35 (3) (2007)
Mourad Baïou, José R. Correa
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. Discret. Optim. 3 (2) (2006)
Mourad Baïou, José R. Correa
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation. Electron. Notes Discret. Math. 19 (2005)
Mourad Baïou, Michel Balinski
Student admissions and faculty recruitment. Theor. Comput. Sci. 322 (2) (2004)
Mourad Baïou, Michel Balinski
Admissions and Recruitment. Am. Math. Mon. 110 (5) (2003)
Mourad Baïou, Ali Ridha Mahjoub
The Steiner Traveling Salesman Polytope and Related Polyhedra. SIAM J. Optim. 13 (2) (2002)
Mourad Baïou, Michel Balinski
Erratum: The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27 (4) (2002)
Mourad Baïou, Michel Balinski
The Stable Allocation (or Ordinal Transportation) Problem. Math. Oper. Res. 27 (3) (2002)
Mourad Baïou
On the dominant of the Steiner 2-edge connected subgraph polytope. Discret. Appl. Math. 112 (1-3) (2001)
Mourad Baïou, Michel Balinski
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discret. Appl. Math. 101 (1-3) (2000)
Mourad Baïou, Michel Balinski
The stable admissions polytope. Math. Program. 87 (3) (2000)
Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
Separation of Partition Inequalities. Math. Oper. Res. 25 (2) (2000)
Mourad Baïou, Ali Ridha Mahjoub
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. SIAM J. Discret. Math. 10 (3) (1997)