Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference9 articles.
1. Atamtürk A (2003) On the facets of the mixed-integer knapsack polyhedron. Math Program 98:145–175
2. Büther M, Briskorn D (2007) Reducing the 0–1 knapsack problem with a single continuous variable to the standard 0–1 knapsack problem. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 629:1–12
3. Du D-Z, Ko K-I, Hu X (2011) Design and analysis of approximation algorithms. Springer, New York
4. Garey MR, Johnson DS (1979) Computers and intractability—a guide to the theory of NP-completeness. W.H Freeman and Company, New York
5. Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J Assoc Comput Mach 22:463–468
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献