On the combinatorial structure of chromatic scheduling polytopes
From MaRDI portal
Publication:2500535
DOI10.1016/J.DAM.2006.03.032zbMATH Open1113.90171OpenAlexW1993498043MaRDI QIDQ2500535FDOQ2500535
Authors: 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
Recommendations
- The combinatorial stages of chromatic scheduling polytopes
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- Cycle-based facets of chromatic scheduling polytopes
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
- Chromatic scheduling and frequency assignment
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Lectures on Polytopes
- Title not available (Why is that?)
- Facets of the linear ordering polytope
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- The integer hull of a convex rational polytope
- Chromatic scheduling and frequency assignment
- Consecutive colorings of graphs
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
Cited In (7)
- The combinatorial stages of chromatic scheduling polytopes
- On the extension complexity of scheduling polytopes
- Cycle-based facets of chromatic scheduling polytopes
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
- Chromatic scheduling
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- On non-superperfection of edge intersection graphs of paths
This page was built for publication: On the combinatorial structure of chromatic scheduling polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500535)