Pages that link to "Item:Q1296060"
From MaRDI portal
The following pages link to Improving heuristics for the frequency assignment problem (Q1296060):
Displayed 11 items.
- A memetic algorithm for graph coloring (Q1043356) (← links)
- Lower bounding techniques for frequency assignment (Q1292811) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- An enumerative algorithm for the frequency assignment problem (Q1399116) (← links)
- Generation of lower bounds for minimum span frequency assignment (Q1602703) (← links)
- Graph imperfection. I (Q1850556) (← links)
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem (Q1877917) (← links)
- Optimized planning of frequency hopping in cellular networks (Q1886738) (← links)
- Models and methods for frequency assignment with cumulative interference constraints (Q3499441) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)