Characteristics of good meta-heuristic algorithms for the frequency assignment problem

DOI10.1023/A:1014919603430MaRDI QIDQ1599351zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 9 June 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1014919603430

zbMATH Keywords

algorithmsradio frequency assignmentweighted constraints

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• Algorithms for the generalized weighted frequency assignment problem
• Models and solution techniques for frequency assignment problems
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• Lower bounds for fixed spectrum frequency assignment
• Improving heuristics for the frequency assignment problem

Cited in

(5)

• Combinatorial optimization in system configuration design
• Lower bounds for fixed spectrum frequency assignment
• Polyhedral studies for minimum‐span graph labelling with integer distance constraints
• Algorithms for the generalized weighted frequency assignment problem
• Models and solution techniques for frequency assignment problems

This page was built for publication: Characteristics of good meta-heuristic algorithms for the frequency assignment problem

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