Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques

DOI10.1016/J.DISOPT.2008.09.002zbMath1158.90353OpenAlexW1997942259MaRDI QIDQ1013296

Javier Marenco, Annegret K. Wagler

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.002

zbMATH Keywords

separationfacetsbandwidth allocationpolyhedral combinatorics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Cycle-based facets of chromatic scheduling polytopes

Cites Work

• Chromatic scheduling and frequency assignment
• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
• On the combinatorial structure of chromatic scheduling polytopes
• Consecutive colorings of graphs

This page was built for publication: Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques