Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Relocation problems are hard;Amir;International Journal of Computer Mathematics,1988
2. Scheduling subject to resource constraints: Classification and complexity;Blazewicz;Discrete Applied Mathematics,1983
3. Discrete variable extremum problems;Dantzig;Operations Research,1957
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Bin packing can be solved within 1+ε in linear time;Fermandez de la Vega;Combinatorica,1981
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献