Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892683 | Computers & Operations Research | 2018 | 10 Pages |
Abstract
Experiments show that our algorithm is faster than the worst-case optimal algorithm of Tomita et al. on 60 out of 74 standard structured and random benchmark instances: we solve 48 instances 1.2 to 2.2 times faster, and solve the remaining 12 instances 3.6 to 47.6 times faster. We also see consistent speed improvements over the algorithm of Naudé: solving 61 instances 1.2 to 2.4 times faster. To the best of our knowledge, we are the first to achieve such speed-ups compared to these state-of-the-art algorithms on these standard benchmarks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Pablo San Segundo, Jorge Artieda, Darren Strash,