| * | 2008 |
|---|
| 23 | EE | Mourad Baïou,
Francisco Barahona:
On the p-median polytope of Y-free graphs.
Discrete Optimization 5(2): 205-219 (2008) |
| 22 | EE | Mourad Baïou,
Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees.
Networks 52(4): 227-234 (2008) |
| 2007 |
|---|
| 21 | EE | 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 Journal of Research and Development 51(3/4): 391-408 (2007) |
| 2006 |
|---|
| 20 | EE | Francisco Barahona:
Network reinforcement.
Math. Program. 105(2-3): 181-200 (2006) |
| 2005 |
|---|
| 19 | EE | Francisco Barahona,
Fabián A. Chudak:
Near-optimal solutions to large-scale facility location problems.
Discrete Optimization 2(1): 35-50 (2005) |
| 18 | EE | Marcos Goycoolea,
Alan T. Murray,
Francisco Barahona,
Rafael Epstein,
Andres Weintraub:
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches.
Operations Research 53(3): 490-500 (2005) |
| 2004 |
|---|
| 17 | EE | Francisco Barahona,
Hervé Kerivin:
Separation of partition inequalities with terminals.
Discrete Optimization 1(2): 129-140 (2004) |
| 16 | EE | Francisco Barahona:
Fractional Packing of T-Joins.
SIAM J. Discrete Math. 17(4): 661-669 (2004) |
| 2003 |
|---|
| 15 | EE | Laura Bahiense,
Francisco Barahona,
Oscar Porto:
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.
J. Comb. Optim. 7(3): 259-282 (2003) |
| 2002 |
|---|
| 14 | | Francisco Barahona,
Ranga Anbil:
On some difficult linear programs coming from set partitioning.
Discrete Applied Mathematics 118(1-2): 3-11 (2002) |
| 2000 |
|---|
| 13 | EE | Mourad Baïou,
Francisco Barahona,
Ali Ridha Mahjoub:
Separation of Partition Inequalities.
Math. Oper. Res. 25(2): 243-254 (2000) |
| 12 | EE | Francisco Barahona:
On the k-cut problem.
Oper. Res. Lett. 26(3): 99-105 (2000) |
| 1998 |
|---|
| 11 | | Francisco Barahona,
David Jensen:
Plant location with minimum inventory.
Math. Program. 83: 101-111 (1998) |
| 1995 |
|---|
| 10 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
On two-connected subgraph polytopes.
Discrete Mathematics 147(1-3): 19-34 (1995) |
| 1994 |
|---|
| 9 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.
SIAM J. Discrete Math. 7(3): 344-358 (1994) |
| 8 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra II: Stable Sets.
SIAM J. Discrete Math. 7(3): 359-371 (1994) |
| 7 | EE | Francisco Barahona,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor.
SIAM J. Discrete Math. 7(3): 372-389 (1994) |
| 6 | EE | Francisco Barahona,
Jean Fonlupt,
Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discrete Math. 7(3): 390-402 (1994) |
| 1993 |
|---|
| 5 | | Francisco Barahona:
On cuts and matchings in planar graphs.
Math. Program. 60: 53-68 (1993) |
| 1992 |
|---|
| 4 | | Francisco Barahona,
Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes.
IPCO 1992: 30-43 |
| 1989 |
|---|
| 3 | | Francisco Barahona,
Éva Tardos:
Note on Weintraub's Minimum-Cost Circulation Algorithm.
SIAM J. Comput. 18(3): 579-583 (1989) |
| 1987 |
|---|
| 2 | EE | Francisco Barahona,
Michele Conforti:
A construction for binary matroids.
Discrete Mathematics 66(3): 213-218 (1987) |
| 1986 |
|---|
| 1 | EE | Francisco Barahona,
Martin Grötschel:
On the cycle polytope of a binary matroid.
J. Comb. Theory, Ser. B 40(1): 40-62 (1986) |
