Guided local search
Combinatorial explosion is a well-known phenomenon that prevents complete algorithms
from solving many real-life combinatorial optimization problems. In many situations, heuristic …
from solving many real-life combinatorial optimization problems. In many situations, heuristic …
Models and solution techniques for frequency assignment problems
Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …
[BOOK][B] Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
M Yokoo - 2012 - books.google.com
When multiple agents are in a shared environment, there usually exist con straints among
the possible actions of these agents. A distributed constraint satisfaction problem (distributed …
the possible actions of these agents. A distributed constraint satisfaction problem (distributed …
An ANTS heuristic for the frequency assignment problem
The problem considered in this paper consists in assigning frequencies to radio links
between base stations and mobile transmitters in order to minimize the global interference …
between base stations and mobile transmitters in order to minimize the global interference …
Improving probability learning based local search for graph coloring
This paper presents an improved probability learning based local search algorithm for the
well-known graph coloring problem. The algorithm iterates through three distinct phases: a …
well-known graph coloring problem. The algorithm iterates through three distinct phases: a …
Tabu search for graph coloring, T-colorings and set T-colorings
R Dorne, JK Hao - Meta-heuristics: Advances and trends in local search …, 1999 - Springer
In this paper, a generic tabu search is presented for three coloring problems: graph coloring,
T-colorings and set T-colorings. This algorithm integrates important features such as greedy …
T-colorings and set T-colorings. This algorithm integrates important features such as greedy …
[HTML][HTML] A novel modeling approach for vertical handover based on dynamic k-partite graph in heterogeneous networks
The future network world will be embedded with different generations of wireless
technologies, such as 3G, 4G and 5G. At the same time, the development of new devices …
technologies, such as 3G, 4G and 5G. At the same time, the development of new devices …
Models and solution techniques for frequency assignment problems
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 …
and TV broadcasting, satellite communication, and military operations. In each of these …
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem
R Montemanni, JNJ Moon… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-
assignment problem is presented. For cellular problems, the algorithm can be combined …
assignment problem is presented. For cellular problems, the algorithm can be combined …
[PDF][PDF] Méthaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes
L'optimisation combinatoire occupe une place très importante en recherche opérationnelle,
en mathématiques discrètes et en informatique. Son importance se justifie d'une part par la …
en mathématiques discrètes et en informatique. Son importance se justifie d'une part par la …