Name
Title | ||
|---|---|---|
An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem |
Abstract | ||
|---|---|---|
•A new method is proposed for the Multidimensional Multiple-choice Knapsack Problem.•Pseudo-cuts are derived by a hypothesized pseudo-gap.•A way to enumerate the pseudo-gap is introduced.•This new approach was evaluated on 37 classic benchmark instances.•It discovered 10 new lower bounds, outperforming one state-of-the-art. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2016.11.042 | European Journal of Operational Research |
Keywords | Field | DocType |
Integer programming,Heuristics,Multidimensional Multiple-choice Knapsack,Reduced cost constraint | Mathematical optimization,Combinatorial optimization problem,Multiple choice knapsack problem,Enumeration,Continuous knapsack problem,Heuristics,Integer programming,Time limit,Knapsack problem,Mathematics | Journal |
Volume | Issue | ISSN |
260 | 1 | 0377-2217 |
Citations | PageRank | References |
3 | 0.39 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Gao | 1 | 42 | 5.78 |
| Lu Guanzhou | 2 | 3 | 0.39 |
| Xin Yao | 3 | 14858 | 945.63 |
| Jinlong Li | 4 | 239 | 8.14 |