Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems

DOI10.1007/S10479-006-0156-YMaRDI QIDQ2480207zbMATH OpenOpenAlexFDO

Authors Javier Marenco, Annegret K. Wagler

Publication date 31 March 2008

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0156-y

zbMATH Keywords

bandwidth allocationpolyhedral combinatorics

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

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

• 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
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• Interval vertex-coloring of a graph with forbidden colors

Cited in

(7)

• Cycle-based facets of chromatic scheduling polytopes
• Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
• On the combinatorial structure of chromatic scheduling polytopes
• The combinatorial stages of chromatic scheduling polytopes
• scientific article; zbMATH DE number 2230222 (Why is no real title available?)
• A polyhedral study of a relaxation of the routing and spectrum allocation problem

This page was built for publication: Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems

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