Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem



Computational Optimization and Applications, Vol. 56, #1, pp. 97-111, March 2013

Cited by

Year 2016 : 1 citations

 Jiawei Yuan, Hai-Lin Liu, Chaoda Peng,Population Decomposition-Based Greedy Approach Algorithm for the Multi-Objective Knapsack Problems Int. J. Patt. Recogn. Artif. Intell. 31, 2016

Year 2015 : 3 citations

 KKL Wong
Bridging game theory and the knapsack problem: a theoretical formulation
Journal of Engineering Mathematics, 2015

 J Lv, X Wang, M Huang, H Cheng, F Li
Solving 0-1 knapsack problem by greedy degree and expectation efficiency
Applied Soft Computing, 2015

 A Cerqueus
Bi-objective branch-and-cut algorithms applied to the binary knapsack problem: surrogate upper bound sets, dynamic branching strategies, generation and exploitation of cover inequalities
PhD thesis, University of Nantes, 2015