Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. An algorithm for large zero-one knapsack problems;Balas;Oper. Res.,1980
2. ‘Strong’ NP-completeness results: Motivation, examples, and implications;Garey;JACM,1978
3. Resource allocation in hierarchic systems;Gens;Eng. Cybernet.,1984
4. Computational complexity of approximation algorithms for combinatorial problems;Gens,1979
5. Optimal center location in simple networks;Goldman;Transport. Sci.,1971
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献