Mourad Baïou

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