A note of the knapsack problem with special ordered sets

Linear Programming and Extensions.

S. Vajda, George B. Dantzig · Journal of the Royal Statistical Society Series A (General) · 1964 · 960 citations

Business, Computer Science, Algorithms +10

Facet of regular 0–1 polytopes

P. L. Hammer, E. L. Johnson, Uri N. Peled · Mathematical Programming · 1975 · 168 citations

Computing, Computer Science, Mathematics +6

Technical Note—A Note on Zero-One Programming

Manfred Padberg · Operations Research · 1975 · 118 citations

Natural Sciences, Mathematics, Discrete Mathematics +11

(1,k)-configurations and facets for packing problems

Manfred Padberg · Mathematical Programming · 1980 · 79 citations

Natural Sciences, Computer Science, Mathematics +5

The Linear Multiple Choice Knapsack Problem

Eitan Zemel · Operations Research · 1980 · 67 citations

Natural Sciences, Mathematics, Combinatorics +12