An algorithm for packing hypertrees
- Mourad Baïou
- Francisco Barahona
- 2025
- Discrete Mathematics
Publications
23 results for Mourad Baiou
New bounds for the number of lightest cycles in undirected graphs
- Hassene Aissi
- Mourad Baiou
- et al.
- 2025
- Information Processing Letters
Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design
- Rui S. Shibasaki
- Mourad Baïou
- et al.
- 2024
- Annals of Operations Research
On some algorithmic aspects of hypergraphic matroids
- Mourad Baiou
- Francisco Barahona
- 2023
- Discrete Mathematics
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks
- Mourad Baïou
- Francisco Barahona
- 2022
- Discrete Applied Mathematics
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods
- Rui S. Shibasaki
- Mourad Baiou
- et al.
- 2020
- ITOR
An Algorithm to Compute the Nucleolus of Shortest Path Games
- Mourad Baiou
- Francisco Barahona
- 2019
- Algorithmica
Network strength games: the core and the nucleolus
- Mourad Baiou
- Francisco Barahona
- 2018
- Mathematical Programming
Faster Algorithms for Security Games on Matroids
- Mourad Baiou
- Francisco Barahona
- 2018
- Algorithmica
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs
- Mourad Baiou
- Francisco Barahona
- 2018
- Networks