Cycle-based facets of chromatic scheduling polytopes

DOI10.1016/j.disopt.2008.08.004zbMath1158.90352OpenAlexW2083770478MaRDI QIDQ1013295

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.08.004

zbMATH Keywords

separationfacetsbandwidth allocationpolyhedral combinatorics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

A polyhedral study of the acyclic coloring problem

Cites Work

• Unnamed Item
• Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
• Cliques, holes and the vertex coloring polytope
• Parametric shortest path algorithms with an application to cyclic staffing
• Geometric algorithms and combinatorial optimization
• A characterization of the minimum cycle mean in a digraph
• 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
• Facets of the linear ordering polytope
• Consecutive colorings of graphs
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Cycle-based facets of chromatic scheduling polytopes