| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141823 | Discrete Optimization | 2006 | 18 Pages |
Abstract
We show how to transform any inequality defining a facet of some 0/1-polytope into an inequality defining a facet of the acyclic subgraph polytope. While this facet-recycling procedure can potentially be used to construct ‘nasty’ facets, it can also be used to better understand and extend the polyhedral theory of the acyclic subgraph and linear ordering problems.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Samuel Fiorini,