Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods
- Rui S. Shibasaki
- Mourad Baiou
- et al.
- 2020
- ITOR
Publications
Date
Featured collections
Popular topics
46 results for Francisco Barahona
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
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Mourad Baiou
- Francisco Barahona
- 2018
- Mathematical Programming
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs
- Mourad Baiou
- Francisco Barahona
- 2016
- Discrete Optimization
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Mourad Baiou
- Francisco Barahona
- 2016
- SIAM Journal on Discrete Mathematics
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm
- Mourad Baiou
- Francisco Barahona
- 2015
- Algorithmica
On a connection between facility location and perfect graphs
- Mourad Baïou
- Francisco Barahona
- 2014
- Operations Research Letters