Pages that link to "Item:Q1383122"
From MaRDI portal
The following pages link to Frequency assignment in cellular phone networks (Q1383122):
Displayed 14 items.
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- Optimized planning of frequency hopping in cellular networks (Q1886738) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← 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)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)