Francisco Barahona

	2011
28		Mourad Baïou, Francisco Barahona: On the linear relaxation of the p-median problem. Discrete Optimization 8(2): 344-375 (2011)
27		Mourad Baïou, Francisco Barahona, José R. Correa: On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discrete Math. 25(1): 1-20 (2011)
	2010
26		Mourad Baïou, Francisco Barahona, José R. Correa: On the p-median polytope of fork-free graphs. Electronic Notes in Discrete Mathematics 36: 143-149 (2010)
	2009
25		Mourad Baïou, Francisco Barahona: On the Integrality of Some Facility Location Polytopes. SIAM J. Discrete Math. 23(2): 665-679 (2009)
	2008
24		Mourad Baïou, Francisco Barahona: On the p-median polytope of Y-free graphs. Discrete Optimization 5(2): 205-219 (2008)
23		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
22		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
21		Francisco Barahona: Network reinforcement. Math. Program. 105(2-3): 181-200 (2006)
20		Francisco Barahona, Laszlo Ladányi: Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut. RAIRO - Operations Research 40(1): 53-73 (2006)
	2005
19		Francisco Barahona, Fabián A. Chudak: Near-optimal solutions to large-scale facility location problems. Discrete Optimization 2(1): 35-50 (2005)
18		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		Francisco Barahona, Hervé Kerivin: Separation of partition inequalities with terminals. Discrete Optimization 1(2): 129-140 (2004)
16		Francisco Barahona: Fractional Packing of T-Joins. SIAM J. Discrete Math. 17(4): 661-669 (2004)
	2003
15		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		Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub: Separation of Partition Inequalities. Math. Oper. Res. 25(2): 243-254 (2000)
12		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		Francisco Barahona, Ali Ridha Mahjoub: On two-connected subgraph polytopes. Discrete Mathematics 147(1-3): 19-34 (1995)
	1994
9		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		Francisco Barahona, Ali Ridha Mahjoub: Compositions of Graphs and Polyhedra II: Stable Sets. SIAM J. Discrete Math. 7(3): 359-371 (1994)
7		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		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		Francisco Barahona, Michele Conforti: A construction for binary matroids. Discrete Mathematics 66(3): 213-218 (1987)
	1986
1		Francisco Barahona, Martin Grötschel: On the cycle polytope of a binary matroid. J. Comb. Theory, Ser. B 40(1): 40-62 (1986)

Coauthor Index

1	Ranga Anbil	[14]
2	Laura Bahiense	[15]
3	Mourad Baïou	[13] [23] [24] [25] [26] [27] [28]
4	Pawan Chowdhary	[22]
5	Fabián A. Chudak	[19]
6	Michele Conforti	[2]
7	José R. Correa	[26] [27]
8	Rafael Epstein	[18]
9	Markus Ettl	[22]
10	Jean Fonlupt	[6]
11	Marcos Goycoolea	[18]
12	Martin Grötschel	[1]
13	Pu Huang	[22]
14	David Jensen	[11]
15	Hervé Kerivin	[17]
16	Tracy Kimbrel	[22]
17	Laszlo Ladányi	[20] [22]
18	Young M. Lee	[22]
19	Ali Ridha Mahjoub	[4] [6] [7] [8] [9] [10] [13]
20	Alan T. Murray	[18]
21	Oscar Porto	[15]
22	Baruch Schieber	[22]
23	Karthik Sourirajan	[22]
24	Maxim Sviridenko	[22]
25	Grzegorz Swirszcz	[22]
26	Éva Tardos	[3]
27	Andres Weintraub	[18]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page