Models and solution techniques for frequency assignment problems

KI Aardal, SPM Van Hoesel, AMCA Koster… - Annals of Operations …, 2007 - Springer
Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …

[HTML][HTML] Safe separators for treewidth

HL Bodlaender, AMCA Koster - Discrete Mathematics, 2006 - Elsevier
A set of vertices S⊆ V is called a safe separator for treewidth, if S is a separator of G, and the
treewidth of G equals the maximum of the treewidth over all connected components W of GS …

Models and solution techniques for frequency assignment problems

KI Aardal, SPM Van Hoesel, AMCA Koster… - Quarterly Journal of the …, 2003 - Springer
Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, and military operations. In each of these …

[HTML][HTML] Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem

S Ceschia, L Di Gaspero, RM Rosati… - EURO Journal on …, 2022 - Elsevier
Abstract We consider the Minimum Interference Frequency Assignment Problem and we
propose a novel Simulated Annealing approach that makes use of a portfolio of different …

Solving partial constraint satisfaction problems with tree decomposition

AMCA Koster, SPM van Hoesel… - … An International Journal, 2002 - Wiley Online Library
In this paper, we describe a computational study to solve hard partial constraint satisfaction
problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a …

Branch and tree decomposition techniques for discrete optimization

IV Hicks, AMCA Koster… - … Theory, Methods, and …, 2005 - pubsonline.informs.org
This chapter gives a general overview of two emerging techniques for discrete optimization
that have footholds in mathematics, computer science, and operations research: branch …

A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem

A Kolen - Statistica Neerlandica, 2007 - Wiley Online Library
We describe a genetic algorithm for the partial constraint satisfaction problem. The typical
elements of a genetic algorithm, selection, mutation and cross‐over, are filled in with …

[PDF][PDF] Evolutionary computing in telecommunication network design: A survey

P Kampstra, RD Van der Mei… - Vrije Universiteit, Faculty …, 2006 - researchgate.net
Over the past few decades the use of telecommunication services has been growing
dramatically, and many new and advanced services will be brought to the market in the …

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

A Hertz, D Schindl, N Zufferey - 4or, 2005 - Springer
The problem retained for the ROADEF'2001 international challenge was a Frequency
Assignment Problem with polarization constraints (FAPP). This NP-hard problem was …

A column generation and branch-and-cut algorithm for the channel assignment problem

TD Hemazro, B Jaumard, O Marcotte - Computers & operations research, 2008 - Elsevier
We present an exact algorithm for solving the channel assignment problem in cellular
telephony networks. This problem consists of assigning sets of channels to the network cells …