The knapsack problem: A survey

DOI10.1002/nav.3800220110zbMath0305.90038OpenAlexW2072803231MaRDI QIDQ4062194

Harvey M. Salkin, C. A. De Kluyver

Publication date: 1975

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800220110

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Hamilton-Jacobi theories (49L99)

Related Items

A new enumeration scheme for the knapsack problem, Fuzzy approach to multilevel knapsack problems, The knapsack problem with generalized upper bounds, Optimization via rejection-free partial neighbor search, The trim-loss and assortment problems: A survey, Approximate solutions to large scale capacitated facility location problems, An incentive dynamic programming method for the optimization of scholarship assignment, On the computational complexity of the probabilistic traveling salesman problem with deadlines, An extension of a greedy heuristic for the knapsack problem, A hybrid evolutionary search for the generalized quadratic multiple knapsack problem, A complementary greedy heuristic for the knapsack problem, Algorithms to solve the knapsack constrained maximum spanning tree problem, Static main storage packing problems, Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems, A Solution Strategy for a Class of Nonlinear Knapsack Problems, A hybrid approach to discrete mathematical programming, Hard multidimensional multiple choice knapsack problems, an empirical study, The zone hopping problem, A typology of cutting and packing problems, Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem, Heuristic and exact algorithms for the precedence-constrained knapsack problem, Redundancy optimization by linear knapsack approach, Zero-one integer programs with few contraints - lower bounding theory, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Conjugate duality and the curse of dimensionality

Cites Work

• The Journal Selection Problem in a University Library System
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item