Paper Info
Title
A reduction dynamic programming algorithm for the bi-objective integer knapsack problem.
Abstract
•Introduce size reduction and upper bound reduction based on the core concept.•Construct the mixed network consisting of items with different upper bounds.•Develop an efficient dynamic programming algorithm based on the mixed network.•Conduct the time complexity analysis for the reduction procedures.•Conduct the time and space analysis for the developed algorithm.
Year
DOI
Venue
2013
10.1016/j.ejor.2013.05.045
European Journal of Operational Research
Keywords
Field
DocType
Multi-objective programming,Integer knapsack problem,Dynamic programming,Dominance relation,Core concept,State reduction
Integer,Dynamic programming,Mathematical optimization,Dominance relation,Change-making problem,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Mathematics,Pareto principle
Journal
Volume
Issue
ISSN
231
2
0377-2217
Citations 
PageRank 
References 
9
0.47
38
Authors
2
Name
Order
Citations
PageRank
Aiying Rong133127.02
José Rui Figueira285259.84