A polynomial linear search algorithm for the n-dimensional knapsack problem
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Publishing Year
Proceedings Title
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
ISBN
LibreCat-ID
Cite this
Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83. ; 1983. doi:10.1145/800061.808734
Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83. https://doi.org/10.1145/800061.808734
@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search algorithm for the n-dimensional knapsack problem}, DOI={10.1145/800061.808734}, booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983. https://doi.org/10.1145/800061.808734.
F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83, 1983.
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983, doi:10.1145/800061.808734.
Google Scholar
ISBN Search