On the combinatorial structure of chromatic scheduling polytopes
From MaRDI portal
Publication:2500535
DOI10.1016/j.dam.2006.03.032zbMath1113.90171MaRDI QIDQ2500535
Javier Marenco, Annegret K. Wagler
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.032
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Cycle-based facets of chromatic scheduling polytopes, Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
Cites Work
- Unnamed Item
- Chromatic scheduling and frequency assignment
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- The Integer Hull of a Convex Rational Polytope
- Facets of the linear ordering polytope
- Consecutive colorings of graphs
- Lectures on Polytopes
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES