Author:
Dyer M.E.,Riha W.O.,Walker J.
Subject
Applied Mathematics,Computational Mathematics
Reference23 articles.
1. A computational study of a multiple-choice knapsack algorithm;Armstrong;ACM Trans. Math. Software,1983
2. Pivot and complement — a heuristic for 0–1 programming;Balas;Management Sci.,1980
3. A mathematical programming system for preference and compatibility. Maximised menu planning and scheduling;Balintfy;Math. Programming,1978
4. Hard knapsack problems;Chvatal;Oper. Res.,1980
5. A dynamic programming approach for solving the multiple-choice knapsack problem;Dudzinski;Bull. Polish Acad. Sci., Tech. Sci.,1984
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献