Characteristics of good meta-heuristic algorithms for the frequency assignment problem
From MaRDI portal
Publication:1599351
DOI10.1023/A:1014919603430zbMath1015.90050OpenAlexW1526757979MaRDI QIDQ1599351
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
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ Models and solution techniques for frequency assignment problems ⋮ Combinatorial optimization in system configuration design
This page was built for publication: Characteristics of good meta-heuristic algorithms for the frequency assignment problem