Get started
Author

Mourad Baı̈ou

Observed names: BAÏOU, Mourad, Baiou, Mourad, Baïou, Mourad, M. Baiou, Mourad Baiou, Mourad BaÏou, Mourad Baïou
Observed institutions: Centre National de la Recherche Scientifique, IBM (United States), EDP Sciences, École Polytechnique, Université Clermont Auvergne, Mines Saint-Étienne, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, Institut Supérieur d’Informatique, de Modélisation et de leurs Applications, IBM Research - Thomas J. Watson Research Center, Clermont Auvergne INP, Université Blaise Pascal, University of Chile
ORCID: 0000-0003-0735-7689
Observed ORCID: 0000-0003-0735-7689
OpenAlex ID: A5020748279
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
2000 · Mourad Baı̈ou, Michel Balinski · Discrete Applied Mathematics · 95
The stable admissions polytope
2000 · Mourad Baïou, Michel Balinski · Mathematical Programming · 64
The Stable Allocation (or Ordinal Transportation) Problem
2002 · Mourad Baïou, Michel Balinski · Mathematics of Operations Research · 60
Erratum: The Stable Allocation (or Ordinal Transportation) Problem
2002 · Mourad Baïou, Michel Balinski · Mathematics of Operations Research · 52
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
1997 · Mourad Baïou, Ali Ridha Mahjoub · SIAM Journal on Discrete Mathematics · 38
Separation of Partition Inequalities
2000 · Mourad Baïou, Francisco Barahona, et al. · Mathematics of Operations Research · 34
Student admissions and faculty recruitment
2004 · Mourad Baı̈ou, Michel Balinski · Theoretical Computer Science · 23
PDF
On the Integrality of Some Facility Location Polytopes
2009 · Mourad Baïou, Francisco Barahona · SIAM Journal on Discrete Mathematics · 14
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm
2015 · Mourad Baïou, Francisco Barahona · Algorithmica · 13
Le probleme du sous-graphe steiner 2-arete connexe : approche polyedrale
1996 · Mourad Baı̈ou · 12
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
2020 · Rui S. Shibasaki, Mourad Baiou, et al. · International Transactions in Operational Research · 8
A polyhedral study of a two level facility location model
2014 · Mourad Baïou, Francisco Barahona · RAIRO - Operations Research · 8
On the linear relaxation of the p -median problem
2011 · Mourad Baïou, Francisco Barahona · Discrete Optimization · 8
PDF
On the p -median polytope of Y -free graphs
2007 · Mourad Baïou, Francisco Barahona · Discrete Optimization · 8
PDF
Admissions and Recruitment
2003 · Mourad Baïou, Michel Balinski · American Mathematical Monthly · 8
On the dominant of the Steiner 2-edge connected subgraph polytope
2001 · Mourad Baı̈ou · Discrete Applied Mathematics · 8
A branch-and-cut algorithm for the balanced traveling salesman problem
2024 · Thi Quynh Trang Vo, Mourad Baiou, et al. · Journal of Combinatorial Optimization · 7
PDF
A linear programming approach to increasing the weight of all minimum spanning trees
2008 · Mourad Baïou, Francisco Barahona · Networks · 6
Combinatorial Optimization
2020 · Mourad Baïou, Bernard Gendron, et al. · Lecture notes in computer science · 5
On the Nucleolus of Shortest Path Games
2017 · Mourad Baïou, Francisco Barahona · Lecture notes in computer science · 5
Partition Inequalities: Separation, Extensions and Network Design,
2011 · Ali Ridha Mahjoub, Francisco Barahona, et al. · 5
Characterizations of the optimal stable allocation mechanism
2006 · Mourad Baïou, Michel Balinski · Operations Research Letters · 5
On some algorithmic aspects of hypergraphic matroids
2022 · Mourad Baiou, Francisco Barahona · Discrete Mathematics · 4
PDF
Nash Balanced Assignment Problem
2022 · Minh Hieu Nguyen, Mourad Baiou, et al. · Lecture notes in computer science · 4
Faster Algorithms for Security Games on Matroids
2018 · Mourad Baïou, Francisco Barahona · Algorithmica · 4
Works count: 96
Citation count: 564
H-index: 10
I10-index: 10
Year
Topic
Type