Pages that link to "Item:Q1013296"
From MaRDI portal
The following pages link to Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296):
Displaying 4 items.
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- On the combinatorial structure of chromatic scheduling polytopes (Q2500535) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)