Francisco Barahona

发表

Separating from the dominant of the spanning tree polytope

Francisco Barahona, F. Barahona, 1992, Oper. Res. Lett..

On a connection between facility location and perfect graphs

Francisco Barahona, Mourad Baïou, F. Barahona, 2014, Oper. Res. Lett..

On the p-median polytope of Y-free graphs

Francisco Barahona, Mourad Baïou, 2008, Discret. Optim..

Fractional Packing of T-Joins

Francisco Barahona, 2004, SIAM J. Discret. Math..

Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem

Francisco Barahona, F. Barahona, 1990, Polyhedral Combinatorics.

Network strength games: the core and the nucleolus

Francisco Barahona, Mourad Baïou, F. Barahona, 2018, Math. Program..

Faster Algorithms for Security Games on Matroids

Francisco Barahona, Mourad Baïou, F. Barahona, 2018, Algorithmica.

Facets of the Bipartite Subgraph Polytope

Martin Grötschel, Ali Ridha Mahjoub, Francisco Barahona, 1985, Math. Oper. Res..

A solvable case of quadratic 0-1 programming

Francisco Barahona, F. Barahona, 1986, Discret. Appl. Math..

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm

Francisco Barahona, Mourad Baïou, F. Barahona, 2015, Algorithmica.

Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs

Francisco Barahona, Mourad Baïou, F. Barahona, 2014, SIAM J. Discret. Math..

On 2-Connected Subgraph Polytopes

Ali Ridha Mahjoub, Francisco Barahona, 1992, IPCO.

Demonstrating the benefits of source-mask optimization and enabling technologies through experiment and simulations

Kafai Lai, Scott Halle, Aasutosh Dave, 2010, Advanced Lithography.

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms

José R. Correa, Francisco Barahona, Mourad Baïou, 2011, SIAM J. Discret. Math..

Solving Large Scale Uncapacitated Facility Location Problems

Fabián A. Chudak, Francisco Barahona, 2000 .

Inventory allocation and transportation scheduling for logistics of network-centric military operations

Young M. Lee, Baruch Schieber, Tracy Kimbrel, 2007, IBM J. Res. Dev..

Robust capacity planning in semiconductor manufacturing

Oktay Günlük, Francisco Barahona, Stuart Bermon, 2005 .

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Laura Bahiense, Francisco Barahona, Oscar Porto, 2003, J. Comb. Optim..

Packing Spanning Trees

Francisco Barahona, F. Barahona, 1995, Math. Oper. Res..

Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches

Francisco Barahona, Alan T. Murray, Andrés Weintraub, 2005, Oper. Res..

On some difficult linear programs coming from set partitioning

Francisco Barahona, Ranga Anbil, F. Barahona, 2002, Discret. Appl. Math..

Agile logistics simulation and optimization for managing disaster responses

Marek Petrik, Markus Ettl, Francisco Barahona, 2013, 2013 Winter Simulations Conference (WSC).

Facets of the balanced (acyclic) induced subgraph polytope

Ali Ridha Mahjoub, Francisco Barahona, 1989, Math. Program..

On the Location and p-Median Polytopes

Francisco Barahona, Mourad Baïou, F. Barahona, 2008, Bonn Workshop of Combinatorial Optimization.

A construction for binary matroids

Michele Conforti, Francisco Barahona, F. Barahona, 1987, Discret. Math..

Network Design Using Cut Inequalities

Francisco Barahona, F. Barahona, 1996, SIAM J. Optim..

On the linear relaxation of the p-median problem

Francisco Barahona, Mourad Baïou, 2011, Discret. Optim..

On the k-cut problem

Francisco Barahona, F. Barahona, 2000, Oper. Res. Lett..

A linear programming approach to increasing the weight of all minimum spanning trees

Francisco Barahona, Mourad Baïou, F. Barahona, 2008, Networks.

Note on Weintraub's Minimum-Cost Circulation Algorithm

Éva Tardos, Francisco Barahona, F. Barahona, 1989, SIAM J. Comput..

An Algorithm to Compute the Nucleolus of Shortest Path Games

Francisco Barahona, Mourad Baïou, 2019, Algorithmica.

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs

Francisco Barahona, Mourad Baïou, 2016, SIAM J. Discret. Math..

On the cut polytope

Ali Ridha Mahjoub, Francisco Barahona, F. Barahona, 1986, Math. Program..

Near-optimal solutions to large-scale facility location problems

Fabián A. Chudak, Francisco Barahona, 2005, Discret. Optim..

On the p‐median polytope and the odd directed cycle inequalities: Oriented graphs

Francisco Barahona, Mourad Baïou, F. Barahona, 2018, Networks.

On the Integrality of Some Facility Location Polytopes

Francisco Barahona, Mourad Baïou, F. Barahona, 2009, SIAM J. Discret. Math..

Simulation based analytics for efficient planning and management in multimodal freight transportation industry

Milind R. Naphade, Parijat Dube, Francisco Barahona, 2014, Proceedings of the Winter Simulation Conference 2014.

Intensive optimization of masks and sources for 22nm lithography

Kafai Lai, Yuri Granik, Katya Scheinberg, 2009, Advanced Lithography.

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

Francisco Barahona, Mourad Baïou, F. Barahona, 2016, IPCO.

Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem

Francisco Barahona, Mourad Baïou, 2016, IPCO.

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs

Francisco Barahona, Mourad Baïou, 2016, Discret. Optim..

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Separation of Partition Inequalities

Ali Ridha Mahjoub, Francisco Barahona, Mourad Baïou, 2000, Math. Oper. Res..

IBM Research Report On the Location and p-Median Polytopes

Francisco Barahona, Mourad Baïou, F. Barahona, 2008 .

On the cycle polytope of a binary matroid

Francisco Barahona, Martin Grötschel, M. Grötschel, 1986, J. Comb. Theory, Ser. B.

Compositions of Graphs and Polyhedra II: Stable Sets

Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

Habitat Dispersion in Forest Planning and the Stable Set Problem

Francisco Barahona, Andrés Weintraub, Rafael Epstein, 1992, Oper. Res..

Exact arborescences, matchings and cycles

William R. Pulleyblank, Francisco Barahona, F. Barahona, 1987, Discret. Appl. Math..

On the p-median polytope of fork-free graphs

José R. Correa, Francisco Barahona, Mourad Baïou, 2010, Electron. Notes Discret. Math..

Experiments in quadratic 0–1 programming

Michael Jünger, Gerhard Reinelt, Francisco Barahona, 1989, Math. Program..

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1988, Oper. Res..

Plant location with minimum inventory

Francisco Barahona, David L. Jensen, F. Barahona, 1998, Math. Program..

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut

Francisco Barahona, Laszlo Ladányi, 2006, RAIRO Oper. Res..

On two-connected subgraph polytopes

Ali Ridha Mahjoub, Francisco Barahona, F. Barahona, 1995, Discret. Math..

Application de l'optimisation combinatoire à certains modèles de verres de spins : complexité et simulations

Francisco Barahona, Francisco Barahona, Francisco Barahona, 1980 .

The volume algorithm: producing primal solutions with a subgradient method

Francisco Barahona, Ranga Anbil, F. Barahona, 2000, Math. Program..

On cuts and matchings in planar graphs

Francisco Barahona, F. Barahona, 1993, Math. Program..

Separation of partition inequalities with terminals

Francisco Barahona, Hervé Kerivin, F. Barahona, 2004, Discret. Optim..

Network reinforcement

Francisco Barahona, F. Barahona, 2006, Math. Program..

The Dominating Set Polytope via Facility Location

Francisco Barahona, Mourad Baïou, 2014, ISCO.

On the Nucleolus of Shortest Path Games

Francisco Barahona, Mourad Baïou, 2017, SAGT.

A submodular network simplex method

William H. Cunningham, Francisco Barahona, 1984 .

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs

Jean Fonlupt, Ali Ridha Mahjoub, Francisco Barahona, 1994, SIAM J. Discret. Math..

A lagrangian relaxation approach for a machinery location problem in forest harvesting

Francisco Barahona, Monique Guignard, Jorge Vera, 2003 .

Logical Credal Networks pdf

Alexander G. Gray, Radu Marinescu, Francisco Barahona, 2021, NeurIPS.

On some algorithmic aspects of hypergraphic matroids

Francisco Barahona, Mourad Baiou, F. Barahona, 2021, Discret. Math..

Network disconnection games: A game theoretic approach to checkpoint evaluation in networks

Francisco Barahona, Mourad Baïou, F. Barahona, 2020, Discret. Appl. Math..

Training Neural Networks with an algorithm for piecewise linear functions

Francisco Barahona, Joao Goncalves, 2021 .