A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes

Integer and Combinatorial Optimization

H. P. Williams, George L. Nemhauser, Laurence A. Wolsey · Journal of the Operational Research Society · 1990 · 5.5K citations

A Branch-and-Price Algorithm for the Generalized Assignment Problem

Martin Savelsbergh · Operations Research · 1997 · 424 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +18

A Minimal Algorithm for the 0-1 Knapsack Problem

David Pisinger · Operations Research · 1997 · 244 citations

Mathematical Programming, Engineering, Computational Complexity +17

Efficient algorithms for the capacitated concentrator location problem

Hasan Pirkul · Computers & Operations Research · 1987 · 185 citations

Mathematical Programming, Engineering, Combinatorial Problem +6

A column generation approach to capacitated p-median problems

Luiz Antônio Nogueira Lorena, Edson Luiz França Senne · Computers & Operations Research · 2003 · 182 citations

Mathematical Programming, Engineering, Optimization Problem +8