Francisco Barahona

Orcid: 0000-0002-4829-7515

Affiliations:
  • IBM, Yorktown Heights, NY, USA


According to our database1, Francisco Barahona authored at least 66 papers between 1980 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On some algorithmic aspects of hypergraphic matroids.
Discret. Math., 2023

Approximate Inference in Logical Credal Networks.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks.
Discret. Appl. Math., 2022

Logical Credal Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Packing Hypertrees and the k-cut Problem in Hypergraphs.
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

2021
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.
Int. Trans. Oper. Res., 2021

2020
Network strength games: the core and the nucleolus.
Math. Program., 2020

Logical Neural Networks.
CoRR, 2020

On the p-Median Polytope and the Directed Odd Cycle Inequalities.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
An Algorithm to Compute the Nucleolus of Shortest Path Games.
Algorithmica, 2019

Faster Algorithms for Security Games on Matroids.
Algorithmica, 2019

2018
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs.
Networks, 2018

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.
Math. Program., 2018

2017
On the Nucleolus of Shortest Path Games.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.
SIAM J. Discret. Math., 2016

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs.
Discret. Optim., 2016

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm.
Algorithmica, 2016

2014
A polyhedral study of a two level facility location model.
RAIRO Oper. Res., 2014

On a connection between facility location and perfect graphs.
Oper. Res. Lett., 2014

Simulation based analytics for efficient planning and management in multimodal freight transportation industry.
Proceedings of the 2014 Winter Simulation Conference, 2014

The Dominating Set Polytope via Facility Location.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Agile logistics simulation and optimization for managing disaster responses.
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

2011
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms.
SIAM J. Discret. Math., 2011

On the linear relaxation of the p-median problem.
Discret. Optim., 2011

2010
On the p-median polytope of fork-free graphs.
Electron. Notes Discret. Math., 2010

2009
On the Integrality of Some Facility Location Polytopes.
SIAM J. Discret. Math., 2009

2008
A linear programming approach to increasing the weight of all minimum spanning trees.
Networks, 2008

On the p-median polytope of Y-free graphs.
Discret. Optim., 2008

On the Location and <i>p</i>-Median Polytopes.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM J. Res. Dev., 2007

2006
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.
RAIRO Oper. Res., 2006

Network reinforcement.
Math. Program., 2006

2005
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches.
Oper. Res., 2005

Near-optimal solutions to large-scale facility location problems.
Discret. Optim., 2005

2004
Fractional Packing of T-Joins.
SIAM J. Discret. Math., 2004

Separation of partition inequalities with terminals.
Discret. Optim., 2004

2003
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.
J. Comb. Optim., 2003

2002
On some difficult linear programs coming from set partitioning.
Discret. Appl. Math., 2002

2000
On the <i>k</i>-cut problem.
Oper. Res. Lett., 2000

The volume algorithm: producing primal solutions with a subgradient method.
Math. Program., 2000

Separation of Partition Inequalities.
Math. Oper. Res., 2000

1998
Plant location with minimum inventory.
Math. Program., 1998

1996
Network Design Using Cut Inequalities.
SIAM J. Optim., 1996

1995
Packing Spanning Trees.
Math. Oper. Res., 1995

On two-connected subgraph polytopes.
Discret. Math., 1995

1994
Compositions of Graphs and Polyhedra III: Graphs with No W<sub>4</sub> Minor.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra II: Stable Sets.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.
SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discret. Math., 1994

1993
Reducing Matching to Polynomial Size Linear Programming.
SIAM J. Optim., 1993

On cuts and matchings in planar graphs.
Math. Program., 1993

1992
Separating from the dominant of the spanning tree polytope.
Oper. Res. Lett., 1992

Habitat Dispersion in Forest Planning and the Stable Set Problem.
Oper. Res., 1992

On 2-Connected Subgraph Polytopes.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990
Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem.
Proceedings of the Polyhedral Combinatorics, 1990

1989
Note on Weintraub's Minimum-Cost Circulation Algorithm.
SIAM J. Comput., 1989

Facets of the balanced (acyclic) induced subgraph polytope.
Math. Program., 1989

Experiments in quadratic 0-1 programming.
Math. Program., 1989

1988
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.
Oper. Res., 1988

1987
A construction for binary matroids.
Discret. Math., 1987

Exact arborescences, matchings and cycles.
Discret. Appl. Math., 1987

1986
On the cut polytope.
Math. Program., 1986

On the cycle polytope of a binary matroid.
J. Comb. Theory B, 1986

A solvable case of quadratic 0-1 programming.
Discret. Appl. Math., 1986

1985
Facets of the Bipartite Subgraph Polytope.
Math. Oper. Res., 1985

1980
Application de l'optimisation combinatoire à certains modèles de verres de spins : complexité et simulations.
PhD thesis, 1980


  Loading...