Pages that link to "Item:Q5920489"
From MaRDI portal
The following pages link to Models and solution techniques for frequency assignment problems (Q5920489):
Displaying 50 items.
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Frequency assignment in a SDMA satellite communication system with beam decentring feature (Q377718) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- An efficient self-stabilizing distance-2 coloring algorithm (Q442253) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Bounds on spectrum graph coloring (Q510538) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications (Q816668) (← links)
- Frequency reassignment problem in mobile communication networks (Q878566) (← links)
- Partial integration of frequency allocation within antenna positioning in GSM mobile networks (Q958101) (← links)
- Frequency assignment problem in satellite communications using differential evolution (Q991373) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← links)
- Circular backbone colorings: on matching and tree backbones of planar graphs (Q1627845) (← links)
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks (Q1628035) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Weighted improper colouring (Q1932354) (← links)
- Modeling the packing coloring problem of graphs (Q2009921) (← links)
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures (Q2079984) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Matchings under distance constraints. I (Q2241576) (← links)
- Contrast in greyscales of graphs (Q2307508) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- \(L(2,1)\)-labelings of some families of oriented planar graphs (Q2442267) (← links)
- \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling (Q2668746) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- (Q2857442) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- The Importance of Proper Diversity Management in Evolutionary Algorithms for Combinatorial Optimization (Q2958238) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Mathematical Optimization Models for WLAN Planning (Q3404474) (← links)
- An Efficient Self-stabilizing Distance-2 Coloring Algorithm (Q3408175) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Methods for operations planning in airport decision support systems (Q5896797) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
