Journal of Computer and System Sciences · 2004 · 49 citations · 17 references
ComputingComputer ScienceAlgorithmsCombinatorial OptimizationProbabilistic CombinatoricsRandomized AlgorithmsRandomized ComplexityRandomized ComputationKnapsack ApproximationKnapsack ProblemsLower Bounds For Randomized AlgorithmsPolynomial Time ComplexityPolynomial-time Algorithms
17
Discrete-Variable Extremum Problems
George B. Dantzig · Operations Research · 1957 · 913 citations
An Algorithm for Large Zero-One Knapsack Problems
Egon Balas, Eitan Zemel · Operations Research · 1980 · 471 citations