| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10523845 | Discrete Optimization | 2005 | 15 Pages |
Abstract
The practical importance of the cycle inequalities is evaluated in a computational study. For this, we revisit existing polynomial time separation algorithms. The results show that the performance of state-of-the-art integer programming solvers can be improved by exploiting this general structure.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Arie M.C.A. Koster, Adrian Zymolka,