Merging and Sorting Applied to the Zero-One Knapsack Problem

DOI10.1287/OPRE.23.6.1099MaRDI QIDQ4088574zbMATH OpenOpenAlexFDO

Authors Joachim H. Ahrens, Gerd Finke

Publication date 1975

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.23.6.1099

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(13)

• A new enumeration scheme for the knapsack problem
• Dynamic programming algorithms for the zero-one knapsack problem
• Solution of the zero-one multiple knapsack problem
• An algorithm and efficient data structures for the binary knapsack problem
• Solving dense subset-sum problems by using analytical number theory
• On space-efficient algorithms for certain NP-complete problems
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
• An efficient pruning algorithm for value independent knapsack problem using a DAG structure
• Two linear approximation algorithms for the subset-sum problem
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• A heuristic routine for solving large loading problems
• A hybrid approach to discrete mathematical programming
• Local-search based heuristics for advertisement scheduling

This page was built for publication: Merging and Sorting Applied to the Zero-One Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088574)