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

DOI10.1016/J.EJOR.2015.12.016zbMATH Open1346.90232OpenAlexW2314628782MaRDI QIDQ322774FDOQ322774

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

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

Recommendations

• scientific article; zbMATH DE number 1263991
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 1795728
• Models and solution techniques for frequency assignment problems
• Frequency assignment in cellular phone networks

zbMATH Keywords

heuristicschannel assignmentminimum coloring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Tabu search for frequency assignment in mobile radio networks
• A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
• Local search algorithms for the radio link frequency assignment problem
• Contrast in greyscales of graphs

Uses Software

• Matlab
• CALMA
• AMPL
• CPLEX

This page was built for publication: Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322774)