Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Change-making problem
OpenAlex ID:
C17722475
Multistage Cutting Stock Problems of Two and More Dimensions
1965
·
P. C. Gilmore
, R. E. Gomory
·
Operations Research
·
950
Computing Partitions with Applications to the Knapsack Problem
1974
·
Ellis Horowitz
, Sartaj Sahni
·
Journal of the ACM
·
708
PDF
The Theory and Computation of Knapsack Functions
1966
·
P. C. Gilmore
, R. E. Gomory
·
Operations Research
·
676
A branch and bound algorithm for the generalized assignment problem
1975
·
G. Terry Ross
, Richard M. Soland
·
Mathematical Programming
·
568
Where are the hard knapsack problems?
2004
·
David Pisinger
·
Computers & Operations Research
·
563
The multidimensional 0–1 knapsack problem: An overview
2003
·
Arnaud Fréville
·
European Journal of Operational Research
·
525
An Algorithm for Large Zero-One Knapsack Problems
1980
·
Egon Balas
, Eitan Zemel
·
Operations Research
·
524
Algorithms for Knapsack Problems
1987
·
Silvano Martello
, Paolo Toth
·
North-Holland mathematics studies
·
506
The Multiple-Choice Knapsack Problem
1979
·
Prabhakant Sinha
, Andris A. Zoltners
·
Operations Research
·
461
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
1999
·
Silvano Martello
, David Pisinger
, et al.
·
Management Science
·
456
New trends in exact algorithms for the 0–1 knapsack problem
2000
·
Silvano Martello
, David Pisinger
, et al.
·
European Journal of Operational Research
·
333
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
2008
·
Brian C. Dean
, Michel X. Goemans
, et al.
·
Mathematics of Operations Research
·
308
A minimal algorithm for the multiple-choice knapsack problem
1995
·
David Pisinger
·
European Journal of Operational Research
·
296
An efficient approximation for the Generalized Assignment Problem
2006
·
Reuven Cohen
, Liran Katzir
, et al.
·
Information Processing Letters
·
290
A Minimal Algorithm for the 0-1 Knapsack Problem
1997
·
David Pisinger
·
Operations Research
·
285
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
1979
·
Wei Shih
·
Journal of the Operational Research Society
·
283
The nonlinear knapsack problem – algorithms and applications
2002
·
Kurt M Bretthauer
, Bala Shetty
·
European Journal of Operational Research
·
272
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
2022
·
Valentina Cacchiani
, Manuel Iori
, et al.
·
Computers & Operations Research
·
271
PDF
The knapsack problem: A survey
1975
·
Harvey M. Salkin
, Cornelis A. De Kluyver
·
Naval Research Logistics Quarterly
·
258
A Knapsack Secretary Problem with Applications
2007
·
Moshe Babaioff
, Nicole Immorlica
, et al.
·
Lecture notes in computer science
·
257
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
1985
·
Bezalel Gavish
, Hasan Pirkul
·
Mathematical Programming
·
240
A Branch and Bound Algorithm for the Knapsack Problem
1967
·
Peter J. Kolesar
·
Management Science
·
240
Exact methods for the knapsack problem and its generalizations
1987
·
Krzysztof Dudziński
, Stanisław Walukiewicz
·
European Journal of Operational Research
·
227
Approximation algorithms for knapsack problems with cardinality constraints
2000
·
Alberto Caprara
, Hans Kellerer
, et al.
·
European Journal of Operational Research
·
211
Exact Solution of the Quadratic Knapsack Problem
1999
·
Alberto Caprara
, David Pisinger
, et al.
·
INFORMS journal on computing
·
211
Show more works
View as search
Works count:
1,254
Citation count:
30,740
Year
Topic
Type