Barahona Francisco

Francisco Barahona

Information about the author Francisco Barahona will soon be added to the site.
Found 13 papers in total
On the p-median polytope of Y-free graphs
2008
In this paper we consider a well-known class of valid inequalities for the p -median...
Harvest scheduling subject to maximum area restrictions: exploring exact approaches
2005
We consider a spatial problem arising in forest harvesting. For regulatory reasons,...
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
2006
We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of...
Robust capacity planning in semiconductor manufacturing
2005
We present a stochastic programming approach to capacity planning under demand...
Near-optimal solutions to large-scale facility location problems
2005
We investigate the solution of large-scale instances of the capacitated and...
On the k-cut problem
2000
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal...
Plant location with minimum inventory
1998
We present an integer programming model for plant location with inventory costs. The...
On cuts and matchings in planar graphs
1993
The paper studies the max cut problem in graphs not contractible to K 5 , and optimum...
Separating from the dominant of the spanning tree polytope
1992
The paper studies the separation problem for the partition inequalities that define...
Habitat dispersion in forest planning and the stable set problem
1992
The authors present a model for forest planning with habitat dispersion constraints....
Facets of the balanced (acyclic) induced subgraph polytope
1989
A signed graph is a graph whose edges are labelled positive or negative. A signed...
On dual integrality in matching problems
1989
Edmonds and Johnson proved an integrality property of optimal dual solutions of...
Note on Weintraub’s minimum-cost circulation algorithm
1989
In 1974 Weintraub published an algorithm for the minimum-cost circulation problems...
Papers per page: