On the combinatorial structure of chromatic scheduling polytopes
From MaRDI portal
Publication:2500535
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
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Chromatic scheduling and frequency assignment
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- Consecutive colorings of graphs
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Facets of the linear ordering polytope
- Lectures on Polytopes
- The integer hull of a convex rational polytope
Cited in
(7)- Chromatic scheduling
- 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
- The combinatorial stages of chromatic scheduling polytopes
- On the extension complexity of scheduling polytopes
- 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)