On the computational complexity of Ising spin glass models F Barahona Journal of Physics A: Mathematical and General 15 (10), 3241, 1982 | 1485 | 1982 |

An application of combinatorial optimization to statistical physics and circuit layout design F Barahona, M Grötschel, M Jünger, G Reinelt Operations Research 36 (3), 493-513, 1988 | 589 | 1988 |

On the cut polytope F Barahona, AR Mahjoub Mathematical programming 36, 157-173, 1986 | 560 | 1986 |

The volume algorithm: producing primal solutions with a subgradient method F Barahona, R Anbil Mathematical Programming 87, 385-399, 2000 | 471 | 2000 |

Experiments in quadratic 0–1 programming F Barahona, M Jünger, G Reinelt Mathematical Programming 44 (1-3), 127-137, 1989 | 263 | 1989 |

Network design using cut inequalities F Barahona SIAM Journal on optimization 6 (3), 823-837, 1996 | 245 | 1996 |

Plant location with minimum inventory F Barahona, D Jensen Mathematical Programming 83, 101-111, 1998 | 226 | 1998 |

The max-cut problem on graphs not contractible to K5 F Barahona Operations Research Letters 2 (3), 107-111, 1983 | 214 | 1983 |

Morphology of ground states of two-dimensional frustration model F Barahona, R Maynard, R Rammal, JP Uhry Journal of Physics A: Mathematical and General 15 (2), 673, 1982 | 211 | 1982 |

Harvest scheduling subject to maximum area restrictions: exploring exact approaches M Goycoolea, AT Murray, F Barahona, R Epstein, A Weintraub Operations Research 53 (3), 490-500, 2005 | 182 | 2005 |

Capacity planning under demand uncertainty for semiconductor manufacturing SJ Hood, S Bermon, F Barahona IEEE Transactions on Semiconductor Manufacturing 16 (2), 273-280, 2003 | 182 | 2003 |

Robust capacity planning in semiconductor manufacturing F Barahona, S Bermon, O Günlük, S Hood Naval Research Logistics (NRL) 52 (5), 459-468, 2005 | 180 | 2005 |

A column generation algorithm for solving general forest planning problems with adjacency constraints A Weintraub, F Barahona, R Epstein Forest science 40 (1), 142-161, 1994 | 130 | 1994 |

On cuts and matchings in planar graphs F Barahona Mathematical Programming 60 (1-3), 53-68, 1993 | 129 | 1993 |

A solvable case of quadratic 0–1 programming F Barahona Discrete Applied Mathematics 13 (1), 23-26, 1986 | 112 | 1986 |

Facets of the bipartite subgraph polytope F Barahona, M Grötschel, AR Mahjoub Mathematics of Operations Research 10 (2), 340-358, 1985 | 106 | 1985 |

Logical neural networks R Riegel, A Gray, F Luus, N Khan, N Makondo, IY Akhalwaya, H Qian, ... arXiv preprint arXiv:2006.13155, 2020 | 103 | 2020 |

On the cycle polytope of a binary matroid F Barahona, M Grötschel Journal of combinatorial theory, Series B 40 (1), 40-62, 1986 | 102 | 1986 |

Habitat dispersion in forest planning and the stable set problem F Barahona, A Weintraub, R Epstein Operations Research 40 (1-supplement-1), S14-S21, 1992 | 100 | 1992 |

Near-optimal solutions to large-scale facility location problems F Barahona, FA Chudak Discrete Optimization 2 (1), 35-50, 2005 | 97 | 2005 |