Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks

DOI10.1016/j.ejor.2015.12.016zbMath1346.90232OpenAlexW2314628782MaRDI QIDQ322774

John W. Chinneck, Roshdy H. M. Hafez, Aizaz U. Chaudhry

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.016

zbMATH Keywords

heuristicschannel assignmentminimum coloring

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Contrast in greyscales of graphs

Uses Software

• Matlab
• CALMA
• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• An exact approach for the vertex coloring problem
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• Heuristic manipulation, tabu search and frequency assignment
• A probabilistic heuristic for a computationally difficult set covering problem
• Some simplified NP-complete graph problems
• Greedy randomized adaptive search procedures
• Hierarchical cellular network design with channel allocation
• A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
• A cutting plane algorithm for graph coloring
• A branch-and-cut algorithm for graph coloring
• A survey on vertex coloring problems
• Negative Cycle Separation in Wireless Network Design
• A graph coloring algorithm for large scheduling problems
• The greedy coloring is a bad probabilistic algorithm
• New methods to color the vertices of a graph
• The capacity of wireless networks
• Reducibility among Combinatorial Problems
• Models and solution techniques for frequency assignment problems
• A GRASP for coloring sparse graphs