Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. - Mourad Baïou; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1997)

Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). - Mourad Baïou; Michel Balinski (Discret. Appl. Math., 2000)

Separation of Partition Inequalities. - Mourad Baïou; Francisco Barahona; Ali Ridha Mahjoub (Math. Oper. Res., 2000)

The stable admissions polytope. - Mourad Baïou; Michel Balinski (Math. Program., 2000)

On the dominant of the Steiner 2-edge connected subgraph polytope. - Mourad Baïou (Discret. Appl. Math., 2001)

The Stable Allocation (or Ordinal Transportation) Problem. - Mourad Baïou; Michel Balinski (Math. Oper. Res., 2002)

Erratum: The Stable Allocation (or Ordinal Transportation) Problem. - Mourad Baïou; Michel Balinski (Math. Oper. Res., 2002)

The Steiner Traveling Salesman Polytope and Related Polyhedra. - Mourad Baïou; Ali Ridha Mahjoub (SIAM J. Optim., 2002)

Admissions and Recruitment. - Mourad Baïou; Michel Balinski (Am. Math. Mon., 2003)

Student admissions and faculty recruitment. - Mourad Baïou; Michel Balinski (Theor. Comput. Sci., 2004)

The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. - Mourad Baïou; José R. Correa (Discret. Optim., 2006)

Characterizations of the optimal stable allocation mechanism. - Mourad Baïou; Michel Balinski (Oper. Res. Lett., 2007)

On the Location and p-Median Polytopes. - Mourad Baïou; Francisco Barahona (Bonn Workshop of Combinatorial Optimization, 2008)

On the p-median polytope of Y-free graphs. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2008)

A linear programming approach to increasing the weight of all minimum spanning trees. - Mourad Baïou; Francisco Barahona (Networks, 2008)

On the Integrality of Some Facility Location Polytopes. - Mourad Baïou; Francisco Barahona (SIAM J. Discret. Math., 2009)

On the p-median polytope of fork-free graphs. - Mourad Baïou; Francisco Barahona; José Correa 001 (Electron. Notes Discret. Math., 2010)

On the linear relaxation of the p-median problem. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2011)

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. - Mourad Baïou; Francisco Barahona; José Correa 001 (SIAM J. Discret. Math., 2011)

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. - Mourad Baïou; Laurent Beaudou; Zhentao Li; Vincent Limouzy (ISAAC, 2013)

On a class of intersection graphs. - Mourad Baïou; Laurent Beaudou; Zhentao Li; Vincent Limouzy (CoRR, 2013)

The Dominating Set Polytope via Facility Location. - Mourad Baïou; Francisco Barahona (ISCO, 2014)

On a connection between facility location and perfect graphs. - Mourad Baïou; Francisco Barahona (Oper. Res. Lett., 2014)

A polyhedral study of a two level facility location model. - Mourad Baïou; Francisco Barahona (RAIRO Oper. Res., 2014)

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. - Mourad Baïou; Francisco Barahona (Algorithmica, 2016)

A note on many-to-many matchings and stable allocations. - Mourad Baïou (Discret. Appl. Math., 2016)

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2016)

Preface. - Mourad Baïou; Michel Habib; Lhouari Nourine (RAIRO Oper. Res., 2016)

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. - Mourad Baïou; Francisco Barahona (SIAM J. Discret. Math., 2016)

On the Nucleolus of Shortest Path Games. - Mourad Baïou; Francisco Barahona (SAGT, 2017)

Bounds on Directed star arboricity in some digraph classes. - Henri Perret du Cray; Mourad Baïou; Laurent Beaudou; Vincent Limouzy (Electron. Notes Discret. Math., 2017)

The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. - Mourad Baïou; Rafael Colares; Hervé Kerivin (ISCO, 2018)

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. - Mourad Baïou; Francisco Barahona (Math. Program., 2018)

On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. - Mourad Baïou; Francisco Barahona (Networks, 2018)

Faster Algorithms for Security Games on Matroids. - Mourad Baïou; Francisco Barahona (Algorithmica, 2019)

An Algorithm to Compute the Nucleolus of Shortest Path Games. - Mourad Baïou; Francisco Barahona (Algorithmica, 2019)

MIND: An approach to optimize communication time via middleware tuning. - Abdeslem Belghoul; Mourad Baïou; Farouk Toumani (Inf. Syst., 2019)

On the star forest polytope for trees and cycles. - Méziane Aïder; Lamia Aoudia; Mourad Baïou; Ali Ridha Mahjoub; Viet Hung Nguyen (RAIRO Oper. Res., 2019)

On the p-Median Polytope and the Directed Odd Cycle Inequalities. - Mourad Baïou; Francisco Barahona (ISCO, 2020)

Network strength games: the core and the nucleolus. - Mourad Baïou; Francisco Barahona (Math. Program., 2020)

Algorithms for the Safe Management of Autonomous Vehicles. - Mourad Baïou; Alain Quilliot; Lounis Adouane; Aurélien Mombelli; Zhengze Zhu (FedCSIS, 2021)

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Int. Trans. Oper. Res., 2021)

Safe Management of Autonomous Vehicles. - Aurélien Mombelli; Alejandro Olivas Gonzales; Mourad Baïou; Alain Quilliot (CoDIT, 2022)

Searching for a Safe Shortest Path in a Warehouse. - Aurélien Mombelli; Alain Quilliot; Mourad Baïou (ICORES, 2022)

Nash fairness solutions for balanced TSP. - Minh Hieu Nguyen; Viet Hung Nguyen; Thi Quynh Trang Vo; Mourad Baïou (INOC, 2022)

Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. - José Luis Figueroa González; Mourad Baïou; Alain Quilliot; Hélène Toussaint; Annegret Wagler (ISCO, 2022)

Nash Balanced Assignment Problem. - Minh Hieu Nguyen; Mourad Baïou; Viet Hung Nguyen (ISCO, 2022)

Packing Hypertrees and the k-cut Problem in Hypergraphs. - Mourad Baïou; Francisco Barahona (LION, 2022)

A comparative study of linearization methods for Ordered Weighted Average. - Thi Quynh Trang Vo; Mourad Baïou; Viet Hung Nguyen; Paul Weng (RNDM, 2022)

Horizontal collaboration in forestry: game theory models and algorithms for trading demands. - Mourad Baïou; Gianpaolo Oriolo; Gautier Stauffer (CoRR, 2022)

Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. - Mourad Baïou; Francisco Barahona (Discret. Appl. Math., 2022)

The complexity of the unit stop number problem and its implications to other related problems. - Mourad Baïou; Rafael Colares; Hervé Kerivin (Theor. Comput. Sci., 2022)

A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem. - Aurélien Mombelli; Alain Quilliot; Mourad Baïou (ICORES, 2023)

Multiple Heuristics with Reinforcement Learning to Solve the Safe Shortest Path Problem in a Warehouse. - Aurélien Mombelli; Alain Quilliot; Mourad Baïou (ICORES (Selected Papers), 2023)

Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning. - Thi Quynh Trang Vo; Mourad Baïou; Viet Hung Nguyen; Paul Weng (LION, 2023)

On some algorithmic aspects of hypergraphic matroids. - Mourad Baïou; Francisco Barahona (Discret. Math., 2023)

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. - Mourad Baïou; Rafael Colares; Hervé Kerivin (Eur. J. Oper. Res., 2023)

Proportional Fairness for Combinatorial Optimization. - Minh Hieu Nguyen; Mourad Baïou; Viet Hung Nguyen; Thi Quynh Trang Vo (LATIN (2), 2024)

A project and lift approach for a 2-commodity flow relocation model in a time expanded network. - José Luis Figueroa González; Mourad Baïou; Alain Quilliot; Hélène Toussaint; Annegret Wagler (Discret. Appl. Math., 2024)

Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. - Mourad Baïou; José Correa 001; Rida Laraki (Math. Program., 2024)

Generalized nash fairness solutions for bi-objective minimization problems. - Minh Hieu Nguyen; Mourad Baïou; Viet Hung Nguyen; Thi Quynh Trang Vo (Networks, 2024)

A branch-and-cut algorithm for the balanced traveling salesman problem. - Thi Quynh Trang Vo; Mourad Baïou; Viet Hung Nguyen (J. Comb. Optim., 2024)

Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms. - Minh Hieu Nguyen; Mourad Baïou; Viet Hung Nguyen (Discret. Appl. Math., 2025)

An algorithm for packing hypertrees. - Mourad Baïou; Francisco Barahona (Discret. Math., 2025)

New bounds for the number of lightest cycles in undirected graphs. - Hassene Aissi; Mourad Baïou; Francisco Barahona (Inf. Process. Lett., 2025)

Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Ann. Oper. Res., 2025)