Francisco Barahona

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