Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference37 articles.
1. Linear programming for the 0–1 quadratic knapsack problem;Billionnet;Eur J Oper Res,1996
2. An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem;Billionnet;Eur J Oper Res,2004
3. F-race and iterated f-race: an overview experimental methods for the analysis of optimization algorithms;Birattari,2010
4. A multi-level search strategy for the 0–1 multidimensional knapsack problem;Boussier;Discrete Appl Math,2010
5. Best network flow bound for the quadratic knapsack problem;Chaillou;Lect Notes Math,1983
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献