Paper repository
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods
Rui S. Shibasakia,b , Mourad Baioub, Francisco Barahonac, Philippe Maheyb and Mauricio C. de Souzad,∗ Intl. Trans. in Op. Res. 00 (2020) 1–31 |
An Algorithm to Compute the Nucleolus of Shortest Path Games
M. Baiou, F. Barahona, An Algorithm to Compute the Nucleolus of Shortest Path
Games, Algorithmica
https://doi.org/10.1007/s00453-019-00574-9 |
Network Design
Lower bounds for large scale multicommodity network design: a comparison between Volume and Bundle methods |
MAXIMUM WEIGHTED INDUCED BIPARTITE SUBGRAPHS AND ACYCLIC SUBGRAPHS OF PLANAR CUBIC GRAPHS
MOURAD BAIOU AND FRANCISCO BARAHONA, SIAM J. DISCRETE MATH., Vol. 30, No. 2, pp. 1290–1301 |
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
Mourad Baıou and Francisco Barahona, IPCO 2016 |
Facets of the Bipartite Subgraph Polytope
Francisco Barahona, Martin Grötschel and Ali Ridha Mahjoub, Mathematics of Operations Research, Vol. 10, No. 2 (May, 1985), pp. 340-358
|
A Linear Programming Approach to Increasing the Weight of All Minimum Spanning Trees
Mourad Baïou, Francisco Barahona, Networks, Volume 52, Issue 4, pages 227–234, December 2008 |
1-10 of 47