Merging and Sorting Applied to the Zero-One Knapsack Problem

DOI10.1287/opre.23.6.1099zbMath0324.90047OpenAlexW2127371643MaRDI QIDQ4088574

Gerd Finke, Joachim H. Ahrens

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)

Related Items (12)

A heuristic routine for solving large loading problems ⋮ An efficient pruning algorithm for value independent knapsack problem using a DAG structure ⋮ 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 ⋮ Two linear approximation algorithms for the subset-sum problem ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Shift-and-merge technique for the DP solution of the time-constrained backpacker problem ⋮ A hybrid approach to discrete mathematical programming ⋮ 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

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