Paper repository

link

 

On the k-cut problem

posted Aug 10, 2021, 1:06 PM by Francisco Barahona

F. Barahona, Operations Research Letters 26 (2000) 99–105 

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods

posted May 18, 2020, 2:08 PM by Francisco Barahona


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

posted Apr 23, 2019, 10:27 AM by Francisco Barahona

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

posted Jun 29, 2017, 12:08 PM by Francisco Barahona

Lower bounds for large scale multicommodity network design: a comparison between Volume and Bundle methods

network design

posted Jun 29, 2017, 12:02 PM by Francisco Barahona   [ updated Jun 29, 2017, 12:05 PM ]

XLIX Simposio Brasileiro de Pesquisa Operacional, 2013

MAXIMUM WEIGHTED INDUCED BIPARTITE SUBGRAPHS AND ACYCLIC SUBGRAPHS OF PLANAR CUBIC GRAPHS

posted Jun 28, 2016, 8:02 AM by Francisco Barahona

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

posted Jun 21, 2016, 1:48 PM by Francisco Barahona

Mourad Baıou and Francisco Barahona, IPCO 2016

Facets of the Bipartite Subgraph Polytope

posted Aug 31, 2015, 9:34 AM by Francisco Barahona

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

posted Apr 7, 2015, 1:47 PM by Francisco Barahona

Mourad Baïou, Francisco Barahona, Networks, Volume 52, Issue 4, pages 227–234, December 2008

1-10 of 47