A Direct Descent Binary Knapsack Algorithm

DOI10.1145/322063.322073MaRDI QIDQ4148946zbMATH OpenOpenAlexFDO

Authors Andris A. Zoltners

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Integer programming (90C10)

Cited in

(11)

• 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
• An algorithm and efficient data structures for the binary knapsack problem
• Real-time task reallocation in fault-tolerant distributed computer systems
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems
• The pure fixed charge transportation problem
• A mathematical programming system for preference and compatibility maximized menu planning and scheduling
• Local-search based heuristics for advertisement scheduling

This page was built for publication: A Direct Descent Binary Knapsack Algorithm

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