A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

Knapsack Problems: Algorithms and Computer Implementations

David Connolly, Silvano Martello, Paolo Toth · Journal of the Operational Research Society · 1991 · 3.2K citations

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA · 1981 · 2K citations

Mathematical Programming, Large-scale Global Optimization, Engineering +6

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Local branching

Matteo Fischetti, Andrea Lodi · Mathematical Programming · 2003 · 667 citations

Knapsack Problems: Algorithms and Computer Implementations

David Connolly · Journal of the Operational Research Society · 1991 · 656 citations