Pages that link to "Item:Q1356496"
From MaRDI portal
The following pages link to Bounds for the frequency assignment problem (Q1356496):
Displaying 27 items.
- Bounds on spectrum graph coloring (Q510538) (← links)
- A survey on radio \(k\)-colorings of graphs (Q624122) (← links)
- Lower bounding techniques for frequency assignment (Q1292811) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- An enumerative algorithm for the frequency assignment problem (Q1399116) (← links)
- Colouring weighted bipartite graphs with a co-site constraint (Q1586761) (← links)
- Frequency-distance constraints with large distances (Q1587609) (← links)
- Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems (Q1599359) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- Generation of lower bounds for minimum span frequency assignment (Q1602703) (← links)
- On the span in channel assignment problems: Bounds, computing and counting (Q1810659) (← links)
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem (Q1877917) (← links)
- On the span of a random channel assignment problem (Q2460622) (← links)
- Distance-constrained grid colouring (Q2629563) (← links)
- (Q2752161) (← links)
- On interference graphs (Q2839250) (← links)
- (Q3018219) (← links)
- (Q3127425) (← links)
- (Q3152424) (← links)
- The frequency assignment problem: A solution via nonlinear programming (Q3747202) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Theoretical Computer Science (Q5897358) (← links)
- The edge span of distance two labellings of graphs (Q5928417) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- Minimizing the span \(d\)-walks to compute optimum frequency assignments. (Q5957570) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
