Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897128 | European Journal of Operational Research | 2015 | 11 Pages |
Abstract
We improve an already existing dynamic programming and a tabu search approach significantly. These two are also identified as the most effective heuristics; each with advantages for certain problem characteristics. Additionally we show that lower bounds for SALBP-1 can be distinctly sharpened when merging them and applying problem reduction techniques.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tom Pape,