Pages that link to "Item:Q1327228"
From MaRDI portal
The following pages link to Chromatic scheduling and frequency assignment (Q1327228):
Displayed 13 items.
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- A tabu search algorithm for frequency assignment (Q1919845) (← links)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← 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)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- (Q5708510) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)