Application de l'optimisation combinatoire à certains modèles de verres de spins : complexité et simulations. - Francisco Barahona (1980)

Facets of the Bipartite Subgraph Polytope. - Francisco Barahona; Martin Grötschel; Ali Ridha Mahjoub (Math. Oper. Res., 1985)

A solvable case of quadratic 0-1 programming. - Francisco Barahona (Discret. Appl. Math., 1986)

On the cycle polytope of a binary matroid. - Francisco Barahona; Martin Grötschel (J. Comb. Theory B, 1986)

On the cut polytope. - Francisco Barahona; Ali Ridha Mahjoub (Math. Program., 1986)

Exact arborescences, matchings and cycles. - Francisco Barahona; William R. Pulleyblank (Discret. Appl. Math., 1987)

A construction for binary matroids. - Francisco Barahona; Michele Conforti (Discret. Math., 1987)

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. - Francisco Barahona; Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1988)

Experiments in quadratic 0-1 programming. - Francisco Barahona; Michael Jünger; Gerhard Reinelt (Math. Program., 1989)

Facets of the balanced (acyclic) induced subgraph polytope. - Francisco Barahona; Ali Ridha Mahjoub (Math. Program., 1989)

Note on Weintraub's Minimum-Cost Circulation Algorithm. - Francisco Barahona; Éva Tardos (SIAM J. Comput., 1989)

Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem. - Francisco Barahona (Polyhedral Combinatorics, 1990)

On 2-Connected Subgraph Polytopes. - Francisco Barahona; Ali Ridha Mahjoub (IPCO, 1992)

Habitat Dispersion in Forest Planning and the Stable Set Problem. - Francisco Barahona; Andrés Weintraub; Rafael Epstein (Oper. Res., 1992)

Separating from the dominant of the spanning tree polytope. - Francisco Barahona (Oper. Res. Lett., 1992)

On cuts and matchings in planar graphs. - Francisco Barahona (Math. Program., 1993)

Reducing Matching to Polynomial Size Linear Programming. - Francisco Barahona (SIAM J. Optim., 1993)

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. - Francisco Barahona; Jean Fonlupt; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra II: Stable Sets. - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. - Francisco Barahona; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

On two-connected subgraph polytopes. - Francisco Barahona; Ali Ridha Mahjoub (Discret. Math., 1995)

Packing Spanning Trees. - Francisco Barahona (Math. Oper. Res., 1995)

Network Design Using Cut Inequalities. - Francisco Barahona (SIAM J. Optim., 1996)

Plant location with minimum inventory. - Francisco Barahona; David L. Jensen (Math. Program., 1998)

Separation of Partition Inequalities. - Mourad Baïou; Francisco Barahona; Ali Ridha Mahjoub (Math. Oper. Res., 2000)

The volume algorithm: producing primal solutions with a subgradient method. - Francisco Barahona; Ranga Anbil (Math. Program., 2000)

On the k-cut problem. - Francisco Barahona (Oper. Res. Lett., 2000)

On some difficult linear programs coming from set partitioning. - Francisco Barahona; Ranga Anbil (Discret. Appl. Math., 2002)

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. - Laura Bahiense; Francisco Barahona; Oscar Porto (J. Comb. Optim., 2003)

Separation of partition inequalities with terminals. - Francisco Barahona; Hervé Kerivin (Discret. Optim., 2004)

Fractional Packing of T-Joins. - Francisco Barahona (SIAM J. Discret. Math., 2004)

Near-optimal solutions to large-scale facility location problems. - Francisco Barahona; Fabián A. Chudak (Discret. Optim., 2005)

Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches. - Marcos Goycoolea; Alan T. Murray; Francisco Barahona; Rafael Epstein; Andrés Weintraub (Oper. Res., 2005)

Network reinforcement. - Francisco Barahona (Math. Program., 2006)

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut. - Francisco Barahona; Laszlo Ladányi (RAIRO Oper. Res., 2006)

Inventory allocation and transportation scheduling for logistics of network-centric military operations. - Francisco Barahona; Pawan Chowdhary; Markus Ettl; Pu Huang; Tracy Kimbrel; Laszlo Ladányi; Young M. Lee; Baruch Schieber; Karthik Sourirajan; Maxim Sviridenko; Grzegorz Swirszcz (IBM J. Res. Dev., 2007)

On the Location and p-Median Polytopes. - Mourad Baïou; Francisco Barahona (Bonn Workshop of Combinatorial Optimization, 2008)

On the p-median polytope of Y-free graphs. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2008)

A linear programming approach to increasing the weight of all minimum spanning trees. - Mourad Baïou; Francisco Barahona (Networks, 2008)

On the Integrality of Some Facility Location Polytopes. - Mourad Baïou; Francisco Barahona (SIAM J. Discret. Math., 2009)

On the p-median polytope of fork-free graphs. - Mourad Baïou; Francisco Barahona; José Correa 001 (Electron. Notes Discret. Math., 2010)

On the linear relaxation of the p-median problem. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2011)

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. - Mourad Baïou; Francisco Barahona; José Correa 001 (SIAM J. Discret. Math., 2011)

Agile logistics simulation and optimization for managing disaster responses. - Francisco Barahona; Markus Ettl; Marek Petrik; Peter M. Rimshnick (WSC, 2013)

The Dominating Set Polytope via Facility Location. - Mourad Baïou; Francisco Barahona (ISCO, 2014)

Simulation based analytics for efficient planning and management in multimodal freight transportation industry. - Parijat Dube; João P. M. Gonçalves; Shilpa Mahatma; Francisco Barahona; Milind R. Naphade; Mark Bedeman (WSC, 2014)

On a connection between facility location and perfect graphs. - Mourad Baïou; Francisco Barahona (Oper. Res. Lett., 2014)

A polyhedral study of a two level facility location model. - Mourad Baïou; Francisco Barahona (RAIRO Oper. Res., 2014)

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. - Mourad Baïou; Francisco Barahona (Algorithmica, 2016)

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. - Mourad Baïou; Francisco Barahona (Discret. Optim., 2016)

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. - Mourad Baïou; Francisco Barahona (SIAM J. Discret. Math., 2016)

On the Nucleolus of Shortest Path Games. - Mourad Baïou; Francisco Barahona (SAGT, 2017)

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. - Mourad Baïou; Francisco Barahona (Math. Program., 2018)

On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. - Mourad Baïou; Francisco Barahona (Networks, 2018)

Faster Algorithms for Security Games on Matroids. - Mourad Baïou; Francisco Barahona (Algorithmica, 2019)

An Algorithm to Compute the Nucleolus of Shortest Path Games. - Mourad Baïou; Francisco Barahona (Algorithmica, 2019)

On the p-Median Polytope and the Directed Odd Cycle Inequalities. - Mourad Baïou; Francisco Barahona (ISCO, 2020)

Logical Neural Networks. - Ryan Riegel; Alexander G. Gray; Francois P. S. Luus; Naweed Khan; Ndivhuwo Makondo; Ismail Yunus Akhalwaya; Haifeng Qian; Ronald Fagin; Francisco Barahona; Udit Sharma; Shajith Ikbal; Hima Karanam; et al. (CoRR, 2020)

Network strength games: the core and the nucleolus. - Mourad Baïou; Francisco Barahona (Math. Program., 2020)

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Int. Trans. Oper. Res., 2021)

Packing Hypertrees and the k-cut Problem in Hypergraphs. - Mourad Baïou; Francisco Barahona (LION, 2022)

Logical Credal Networks. - Radu Marinescu 002; Haifeng Qian; Alexander G. Gray; Debarun Bhattacharjya; Francisco Barahona; Tian Gao; Ryan Riegel; Pravinda Sahu (NeurIPS, 2022)

Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. - Mourad Baïou; Francisco Barahona (Discret. Appl. Math., 2022)

Approximate Inference in Logical Credal Networks. - Radu Marinescu 002; Haifeng Qian; Alexander G. Gray; Debarun Bhattacharjya; Francisco Barahona; Tian Gao; Ryan Riegel (IJCAI, 2023)

On some algorithmic aspects of hypergraphic matroids. - Mourad Baïou; Francisco Barahona (Discret. Math., 2023)

An algorithm for packing hypertrees. - Mourad Baïou; Francisco Barahona (Discret. Math., 2025)

New bounds for the number of lightest cycles in undirected graphs. - Hassene Aissi; Mourad Baïou; Francisco Barahona (Inf. Process. Lett., 2025)

Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Ann. Oper. Res., 2025)