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

DOI10.1016/J.DISOPT.2008.09.002MaRDI QIDQ1013296zbMATH OpenOpenAlexFDO

Authors 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

polyhedral combinatoricsfacetsseparationbandwidth allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Cycle-based facets of chromatic scheduling polytopes
• On the combinatorial structure of chromatic scheduling polytopes
• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
• The combinatorial stages of chromatic scheduling polytopes
• Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model

Cites work

• 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
• On the combinatorial structure of chromatic scheduling polytopes

Cited in

(5)

• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
• On the combinatorial structure of chromatic scheduling polytopes
• Cycle-based facets of chromatic scheduling polytopes
• The combinatorial stages of chromatic scheduling polytopes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013296)