A Direct Descent Binary Knapsack Algorithm
From MaRDI portal
Publication:4148946
DOI10.1145/322063.322073zbMath0372.68012OpenAlexW1984060504MaRDI QIDQ4148946
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322063.322073
Related Items
Some computational results on real 0-1 knapsack problems, An improved direct descent algorithm for binary knapsack problems, Dynamic programming algorithms for the zero-one knapsack problem, A multicriteria approach to the location of public facilities, An algorithm for the solution of the 0-1 knapsack problem, A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems, A mathematical programming system for preference and compatibility maximized menu planning and scheduling, An algorithm and efficient data structures for the binary knapsack problem, Real-time task reallocation in fault-tolerant distributed computer systems, The pure fixed charge transportation problem
