Pages that link to "Item:Q2500535"
From MaRDI portal
The following pages link to On the combinatorial structure of chromatic scheduling polytopes (Q2500535):
Displaying 6 items.
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- Chromatic scheduling (Q2822599) (← links)
- On non-superperfection of edge intersection graphs of paths (Q6670498) (← links)