Cycle-based facets of chromatic scheduling polytopes
From MaRDI portal
Publication:1013295
DOI10.1016/j.disopt.2008.08.004zbMath1158.90352MaRDI 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
Related Items
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