Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
From MaRDI portal
Publication:816434
DOI10.1007/s10288-004-0057-3zbMath1134.90471OpenAlexW2022150528MaRDI QIDQ816434
David Schindl, Alain Hertz, Nicolas Zufferey
Publication date: 9 March 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-004-0057-3
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Design of a quality control network for an international food company, The dynamic frequency assignment problem, A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG, Metaheuristics for truck loading in the car production industry, Models and solution techniques for frequency assignment problems
Uses Software
