Recent Papers. They can be found at IBM Cyberdigest, or at Optimization-online. Citations can be found at Google-scholar.
* M. Baiou, F. Barahona, "A linear programming approach to increasing the weight of all minimum spanning trees.''
* M. Baiou, F. Barahona, ``On the p-median polytope of a special class of graphs.''
* M. Baiou, F. Barahona, ``The p-median polytope of restricted Y-graphs.''
Journal Papers
* F. Barahona, L. Ladanyi, "Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-Cut," RAIRO Operations Research 40 (2006) 53-73.
* F. Barahona, "Network Reinforcement," Mathematical Programming 105 (2006) 181-200.
* M Goycolea, A Murray, F. Barahona, R Esptein, A Weintraub, ``Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches," Operations Research 53 (2005) 490-500.
* F. Barahona, S. Bermon, O. Gunluk, S. Hood, ``Robust Capacity Planning in Semiconductor Manufacturing", Naval Research Logistics 52 (2005) 459-468.
* F. Barahona, F. Chudak, ``Near-Optimal Solutions to Large Scale Facility Location Problems,'' Discrete Optimization 2 (2005) 35-50.
* F. Barahona, H. Kerivin, ``Separation of partition inequalities with terminals," Discrete Optimization 1 (2004) 129-140.
* F. Barahona, ``Fractional packing of T-joins,'' SIAM J. on Discrete Mathematics 17 (2004) 661-669.
* L. Bahiense, F. Barahona, O. Porto, ``Solving Steiner Tree Problemsin Graphs with Lagrangian Relaxation," Journal of Combinatorial Optimization 7 (2003) 259-282.
* S. Hood, S. Bermon, F. Barahona, ``Capacity planning under demand uncertainty for semiconductor manufacturing", IEEE Transactions on Semiconductor Manufacturing, 16 (2003) 273-280.
* F. Barahona, R. Anbil, ``On some difficult linear programs coming from set partitionning,'' Discrete Applied Mathematics 118 (2002) 3-11.
* M. Baiou, F. Barahona, A. R. Mahjoub, ``Separation of Partition Inequalities,'' Math. of Operations Research, 25 (2000) 243-254.
* F. Barahona, R. Anbil, ``The Volume Algorithm: producing primal solutions with a subgradient algorithm,'' Mathematical Programming, 87 (2000) 385-399.
* F. Barahona, ``On the k-cut problem,'' Op. Research letters, 26 (2000) 99-105.
* F. Barahona, F. Chudak, ``Solving Large Scale Uncapacitated Facility Location Problems,'' in Approximation and Complexity in Numerical Optimization, P. Pardalos, Ed., (2000) 48-62.
* F. Barahona, D. Jensen, ``Plant location with minimum inventory," Mathematical Programming 83 (1998) 101-112.
* F. Barahona, ``Network Design using cut inequalities," SIAM Journal on Optimization, 6 (1996) 823-837.
* F. Barahona and A. R. Mahjoub, ``On two-connected subgraph polytopes," Discrete Mathematics, 147 (1995) 19-34.
* F. Barahona, ``Packing spanning trees," Mathematics of Operations Research, 20 (1995) 104-115.
* F. Barahona, C. Cabrelli and U. Molter, ``Matching Probability Measures on the line under Translation," Random and Computational Dynamics, 3 (1995) 121-135.
* F. Barahona, "Ground state magnetization of Ising spin glasses", Physical Review B, 49 (1994) 12864-12867.
* A. Weintraub, F. Barahona, R. Epstein, ``A Column Generation Algorithm for Solving General Forest Planning Problems with Adjacency Constraints," Forest Science, 40 (1994) 142-161.
* F. Barahona, A. R. Mahjoub, ``Compositions of graphs and polyhedra I: balanced and acyclic subgraphs," SIAM J. on Discrete Mathematics, 7 (1994) 344-358.
* F. Barahona, A. R. Mahjoub, ``Compositions of graphs and polyhedra II: stable sets," SIAM J. on Discrete Mathematics, 7 (1994) 359-371.
* F. Barahona, A. R. Mahjoub, ``Compositions of graphs and polyhedra III: graphs with no W4 minor," SIAM J. on Discrete Mathematics, 7 (1994) 372-389.
* F. Barahona, J. Fonlupt, A. R. Mahjoub, ``Compositions of graphs and polyhedra IV: acyclic spanning subgraphs," SIAM J. on Discrete Mathematics, 7 (1994) 390-402.
* F. Barahona, ``Reducing matching to polynomial size linear programming," SIAM Journal on Optimization, 3 (1993) 688-695.
* F. Barahona, ``On cuts and matchings in planar graphs," Mathematical Programming, 60 (1993) 53-68.
* F. Barahona, C. Cabrelli and U. Molter, ``Computing the Hutchinson distance by network flow methods," Random and Computational Dynamics, 1 (1992) 117-129.
* F. Barahona, ``Separating from the dominant of the spanning tree polytope," Operations Research Letters, 12 (1992) 201-203.
* F. Barahona, A. Weintraub, R. Epstein, ``Habitat dispersion in Forest Planning and the stable set problem,'' Operations Research, 40 (1992) S14-S21.
* F. Barahona, ``On Via Minimization,'' IEEE Transactions on Circuits and Systems, 37(1990) 527-529.
* F. Barahona, A.R. Mahjoub, ``Facets of the balanced (acyclic) subgraph polytope,'' Mathematical Programming, 45 (1989) 21-33.
* F. Barahona, W.H. Cunningham, ``On dual integrality in matching problems,'' Operations Research Letters, 8 (1989) 245-250.
* F. Barahona, E. Tardos, ``Note on Weintraub's minimum cost circulation algorithm,'' SIAM J. Computing, 18 (1989) 579-583.
* F. Barahona, M. Junger, G. Reinelt, ``Experiments in quadratic 0-1 programming,'' Mathematical Programming, 44 (1989) 127-137.
* F. Barahona, M. Grotschel, M. Junger, G. Reinelt, ``An application of combinatorial optimization to statistical physics and circuit layout design,'' Operations Research, 36 (1988) 493-513.
* F. Barahona, A. Casari, ``On the magnetization of the ground states of Ising spin glasses,'' Computer Physics Communications, 49 (1988) 417-421.
* F. Barahona, M. Conforti, ``A construction for binary matroids,'' Discrete Mathematics, 66 (1987) 213-218.
* F. Barahona, W.R. Pulleyblank, ``Exact arborescences, matchings and cycles,'' Discrete Applied Mathematics, 16 (1987) 91-99.
* F. Barahona, A.R. Mahjoub, ``On the cut polytope,'' Mathematical Programming, 36 (1986) 157-173.
* F. Barahona, ``A solvable case of quadratic 0-1 programming,'' Discrete Applied Mathematics, 13 (1986) 23-26.
* F. Barahona, M. Grotschel, ``On the cycle polytope of a binary matroid,'' Journal of Combinatorial Theory B, 40 (1986) 40-62.
* F. Barahona, ``Finding ground states of random field Ising Ferromagnets,'' J. Phys. A. Math. Gen., 18 (1985) L673-L675.
* F. Barahona, M. Grotschel, A.R. Mahjoub, ``Facets of the bipartite subgraph polytope,'' Mathematics of Operations Research, 10 (1985) 340-358.
* F. Barahona, W.H. Cunningham, ``A submodular network simplex method,'' Mathematical Programming Studies, 22 (1984) 9-31.
* F. Barahona, ``On some weakly bipartite graphs,'' Operations Research Letters, 2 (1983) 239-242.
* F. Barahona, ``The max cut problem in graphs not contractible to K5,'' Operations Research Letters, 2 (1983) 107-111.
* F. Barahona, E. Maccioni, ``On the exact ground-states of three-dimensional Ising spin glasses,'' J. Phys. A. Math. Gen., 15 (1982) L611-L615.
* F. Barahona, ``On the computational complexity of Ising spin glass models,'' J. Phys. A. Math. Gen., 15 (1982) 3241-3253.
* F. Barahona, R. Maynard, R. Rammal, J.P. Uhry, ``Morphology of ground states of a two dimensional frustration model,'' J. Phys. A. Math. Gen., 15 (1982) 673-699.
Proceedings
* F. Barahona and A. R. Mahjoub, ``On two-connected subgraph polytopes," Proceedings of the IPCO Conference, pp. 30-43, 1992.
* F. Barahona, ``Planar multicommodity flows, max cut and the Chinese Postman Problem,'' in Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1, 189-202, 1990.
* F. Barahona, ``On some applications of the Chinese Postman problem,'' in Paths, Flows, and VLSI-Layout, Springer Verlag, 1990.
* F.Barahona, J. P. Uhry, ``An application of combinatorial optimization to physics,'' Methods of Operations Research 40 (1981) 221-224. Symposium uber Operations Research, 1980, Koln, West Germany.
* F. Barahona, J. P. Uhry, ``Complexite et simplicite de certains problemes de physique statistique,'' Actes du Colloque de Cerisy, Regards sur la Theorie des Graphes, June 1980, Presses Politechniques Romandes.
Codes
Codes related to the Volume algorithm can be found at the COIN-OR project.