Displaying similar documents to “Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment”

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Similarity:

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually....

On Minimizing Total Tardiness in a Serial Batching Problem

Philippe Baptiste, Antoine Jouglet (2010)

RAIRO - Operations Research

Similarity:

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time occurs. This problem | ∑ is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

Finding -partitions efficiently

Simone Dantas, Celina M.H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list,...