Francisco Barahona

ORCID

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 19

Top Venues

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel
Approximate Inference in Logical Credal Networks. IJCAI (2023)
Mourad Baïou, Francisco Barahona
On some algorithmic aspects of hypergraphic matroids. Discret. Math. 346 (2) (2023)
Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu
Logical Credal Networks. NeurIPS (2022)
Mourad Baïou, Francisco Barahona
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. Discret. Appl. Math. 308 (2022)
Mourad Baïou, Francisco Barahona
Packing Hypertrees and the k-cut Problem in Hypergraphs. LION (2022)
Rui Sa Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28 (1) (2021)
Haifeng Qian, Radu Marinescu, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu
Logical Credal Networks. CoRR (2021)
Mourad Baïou, Francisco Barahona
On the p-Median Polytope and the Directed Odd Cycle Inequalities. ISCO (2020)
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, Sumit Neelam, Ankita Likhyani, Santosh K. Srivastava
Logical Neural Networks. CoRR (2020)
Mourad Baïou, Francisco Barahona
Network strength games: the core and the nucleolus. Math. Program. 180 (1) (2020)
Mourad Baïou, Francisco Barahona
An Algorithm to Compute the Nucleolus of Shortest Path Games. Algorithmica 81 (8) (2019)
Mourad Baïou, Francisco Barahona
Faster Algorithms for Security Games on Matroids. Algorithmica 81 (3) (2019)
Mourad Baïou, Francisco Barahona
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Math. Program. 172 (1-2) (2018)
Mourad Baïou, Francisco Barahona
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. Networks 71 (4) (2018)
Mourad Baïou, Francisco Barahona
On the Nucleolus of Shortest Path Games. SAGT (2017)
Mourad Baïou, Francisco Barahona
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. IPCO (2016)
Mourad Baïou, Francisco Barahona
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. Algorithmica 74 (3) (2016)
Mourad Baïou, Francisco Barahona
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. SIAM J. Discret. Math. 30 (2) (2016)
Mourad Baïou, Francisco Barahona
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. Discret. Optim. 22 (2016)
Mourad Baïou, Francisco Barahona
On a connection between facility location and perfect graphs. Oper. Res. Lett. 42 (6-7) (2014)
Mourad Baïou, Francisco Barahona
The Dominating Set Polytope via Facility Location. ISCO (2014)
Parijat Dube, João P. M. Gonçalves, Shilpa Mahatma, Francisco Barahona, Milind R. Naphade, Mark Bedeman
Simulation based analytics for efficient planning and management in multimodal freight transportation industry. WSC (2014)
Mourad Baïou, Francisco Barahona
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. IPCO (2014)
Mourad Baïou, Francisco Barahona
A polyhedral study of a two level facility location model. RAIRO Oper. Res. 48 (2) (2014)
Francisco Barahona, Markus Ettl, Marek Petrik, Peter M. Rimshnick
Agile logistics simulation and optimization for managing disaster responses. WSC (2013)
Mourad Baïou, Francisco Barahona
On the linear relaxation of the p-median problem. Discret. Optim. 8 (2) (2011)
Mourad Baïou, Francisco Barahona, José R. Correa
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discret. Math. 25 (1) (2011)
Mourad Baïou, Francisco Barahona, José R. Correa
On the p-median polytope of fork-free graphs. Electron. Notes Discret. Math. 36 (2010)
Mourad Baïou, Francisco Barahona
On the Integrality of Some Facility Location Polytopes. SIAM J. Discret. Math. 23 (2) (2009)
Mourad Baïou, Francisco Barahona
On the p-median polytope of Y-free graphs. Discret. Optim. 5 (2) (2008)
Mourad Baïou, Francisco Barahona
-Median Polytopes. Bonn Workshop of Combinatorial Optimization (2008)
Mourad Baïou, Francisco Barahona
A linear programming approach to increasing the weight of all minimum spanning trees. Networks 52 (4) (2008)
Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51 (3/4) (2007)
Francisco Barahona, Laszlo Ladányi
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut. RAIRO Oper. Res. 40 (1) (2006)
Francisco Barahona
Network reinforcement. Math. Program. 105 (2-3) (2006)
Marcos Goycoolea, Alan T. Murray, Francisco Barahona, Rafael Epstein, Andrés Weintraub
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches. Oper. Res. 53 (3) (2005)
Francisco Barahona, Fabián A. Chudak
Near-optimal solutions to large-scale facility location problems. Discret. Optim. 2 (1) (2005)
Francisco Barahona
Fractional Packing of T-Joins. SIAM J. Discret. Math. 17 (4) (2004)
Francisco Barahona, Hervé Kerivin
Separation of partition inequalities with terminals. Discret. Optim. 1 (2) (2004)
Laura Bahiense, Francisco Barahona, Oscar Porto
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. J. Comb. Optim. 7 (3) (2003)
Francisco Barahona, Ranga Anbil
On some difficult linear programs coming from set partitioning. Discret. Appl. Math. 118 (1-2) (2002)
Francisco Barahona, Ranga Anbil
The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87 (3) (2000)
Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
Separation of Partition Inequalities. Math. Oper. Res. 25 (2) (2000)
Francisco Barahona
-cut problem. Oper. Res. Lett. 26 (3) (2000)
Francisco Barahona, David L. Jensen
Plant location with minimum inventory. Math. Program. 83 (1998)
Francisco Barahona
Network Design Using Cut Inequalities. SIAM J. Optim. 6 (3) (1996)
Francisco Barahona, Ali Ridha Mahjoub
On two-connected subgraph polytopes. Discret. Math. 147 (1-3) (1995)
Francisco Barahona
Packing Spanning Trees. Math. Oper. Res. 20 (1) (1995)
Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM J. Discret. Math. 7 (3) (1994)
Francisco Barahona, Ali Ridha Mahjoub
Minor. SIAM J. Discret. Math. 7 (3) (1994)
Francisco Barahona, Ali Ridha Mahjoub
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. SIAM J. Discret. Math. 7 (3) (1994)
Francisco Barahona, Ali Ridha Mahjoub
Compositions of Graphs and Polyhedra II: Stable Sets. SIAM J. Discret. Math. 7 (3) (1994)
Francisco Barahona
Reducing Matching to Polynomial Size Linear Programming. SIAM J. Optim. 3 (4) (1993)
Francisco Barahona
On cuts and matchings in planar graphs. Math. Program. 60 (1993)
Francisco Barahona
Separating from the dominant of the spanning tree polytope. Oper. Res. Lett. 12 (4) (1992)
Francisco Barahona, Ali Ridha Mahjoub
On 2-Connected Subgraph Polytopes. IPCO (1992)
Francisco Barahona, Andrés Weintraub, Rafael Epstein
Habitat Dispersion in Forest Planning and the Stable Set Problem. Oper. Res. 40 (Supplement-1) (1992)
Francisco Barahona
Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem. Polyhedral Combinatorics (1990)
Francisco Barahona, Éva Tardos
Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18 (3) (1989)
Francisco Barahona, Ali Ridha Mahjoub
Facets of the balanced (acyclic) induced subgraph polytope. Math. Program. 45 (1-3) (1989)
Francisco Barahona, Michael Jünger, Gerhard Reinelt
Experiments in quadratic 0-1 programming. Math. Program. 44 (1-3) (1989)
Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36 (3) (1988)
Francisco Barahona, Michele Conforti
A construction for binary matroids. Discret. Math. 66 (3) (1987)
Francisco Barahona, William R. Pulleyblank
Exact arborescences, matchings and cycles. Discret. Appl. Math. 16 (2) (1987)
Francisco Barahona
A solvable case of quadratic 0-1 programming. Discret. Appl. Math. 13 (1) (1986)
Francisco Barahona, Martin Grötschel
On the cycle polytope of a binary matroid. J. Comb. Theory, Ser. B 40 (1) (1986)
Francisco Barahona, Ali Ridha Mahjoub
On the cut polytope. Math. Program. 36 (2) (1986)
Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub
Facets of the Bipartite Subgraph Polytope. Math. Oper. Res. 10 (2) (1985)

Francisco Barahona.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Francisco Barahona