Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference11 articles.
1. A polynomial-time algorithm for the knapsack problem with two variables;Hirschberg;Journal of the Association for Computing Machinery,1976
2. Aggregation and mixed integer rounding to solve mips;Marchand;Operations Research,2001
3. The 0-1 knapsack problem with a single continuous variable;Marchand;Mathematical Programming,1999
4. Mixing mixed-integer inequalities;Günlük;Mathematical Programming,2001
5. D. Rajan, Designing capacitated survivable networks: Polyhedral analysis and algorithms, Ph.D. Thesis, University of California, Berkeley, 2004
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献