Name
Abstract | ||
|---|---|---|
•A property of the traditional dynamic programming algorithm is identified.•The first algorithm is developed by directly using the property.•The second algorithm is developed by using the property in conjunction with the bound sets.•Insufficiency of linear relaxation solutions to estimate an upper bound set is identified.•An extended upper set is proposed on the basis of the set of the linear relaxation solutions. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ejor.2013.11.032 | European Journal of Operational Research |
Keywords | Field | DocType |
Multi-objective optimization,Integer knapsack problems,Dynamic programming,Bound sets | Mathematical optimization,Hybrid algorithm,Upper and lower bounds,Change-making problem,Branch and price,Algorithm,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Mathematics,Special ordered set | Journal |
Volume | Issue | ISSN |
236 | 1 | 0377-2217 |
Citations | PageRank | References |
6 | 0.45 | 40 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aiying Rong | 1 | 331 | 27.02 |
| José Rui Figueira | 2 | 852 | 59.84 |