Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference41 articles.
1. Akeb H, Hifi M, Mounir MEOA (2011) Local branching-based algorithms for the disjunctively constrained knapsack problem. Comput Ind Eng 60(4):811–820
2. Atamtürk A, Narayanan V (2009) The submodular knapsack polytope. Discrete Optim 6(4):333–344
3. Balas E (1975) Facets of the knapsack polytope. Math Program 8(1):146–164
4. Balas E, Zemel E (1978) Facets of the knapsack polytope from minimal covers. SIAM J Appl Math 34(1):119–148
5. Bettinelli A, Cacchiani V, Malaguti E (2014) Bounds and algorithms for the knapsack problem with conflict graph. Tech. rep., Technical Report OR-14-16, DEIS–University of Bologna, Bologna, Italy
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献