Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895915 | European Journal of Operational Research | 2016 | 35 Pages |
Abstract
In this paper we propose a dynamic programming based heuristic, and a modified exact enumeration procedure to solve the problem. These methods make use of several new lower bounds and dominance rules tailored for the problem in hand. The results of a computational experiment show the effectiveness of the proposed methods, which are able to close all of the previous open instances from the benchmark instance set within very reduced running times.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jordi Pereira,