Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Mourad Baiou
- Francisco Barahona
- 2018
- Mathematical Programming
Paper
Publications
23 results for Mourad Baiou
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs
- Mourad Baiou
- Francisco Barahona
- 2016
- Discrete Optimization
PaperMaximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Mourad Baiou
- Francisco Barahona
- 2016
- SIAM Journal on Discrete Mathematics
PaperStackelberg Bipartite Vertex Cover and the Preflow Algorithm
- Mourad Baiou
- Francisco Barahona
- 2015
- Algorithmica
PaperOn a connection between facility location and perfect graphs
- Mourad Baïou
- Francisco Barahona
- 2014
- Operations Research Letters
PaperA polyhedral study of a two level facility location model
- Mourad Baïou
- Francisco Barahona
- 2014
- RAIRO - Operations Research
PaperOn the p-median polytope and the intersection property: Polyhedra and algorithms*
- Mourad Baïou
- Francisco Barahona
- et al.
- 2011
- SIAM Journal on Discrete Mathematics
PaperOn the linear relaxation of the p-median problem
- Mourad Baïou
- Francisco Barahona
- 2011
- Discrete Optimization
PaperOn the p-median polytope of fork-free graphs
- Mourad Baïou
- Francisco Barahona
- et al.
- 2010
- Electron. Notes Discrete Math.
PaperOn the integrality of some facility location polytopes
- Mourad Baïou
- Francisco Barahona.
- 2009
- SIAM Journal on Discrete Mathematics
Paper