The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve

The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve

We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the

HESA is also a hybrid search algorithm [24] that alternates between feasible and infea- sible regions of the search space. HESA relies on a double-crossover recombination method and

This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem

Despite the appearance of VCSELs functioning at 25 [1] and 35 Gbit/s [2], optical injection-locking can be utilized to overcome obstacles such as direct-modulation induced

7 SBTS: Swap-Based Tabu Search for maximum independent set This Appendix presents a general swap-based tabu search SBTS heuristic for the maximum independent set problem MIS, which

Universit´ e Paris 7-Denis Diderot Alg` ebre et G´ eom´ etrieM. Licence de math´ ematiques et informatique Ann´

The GVCP consists in finding the minimum number of colors (or equivalently the minimum number of subsets), called chromatic number χ(G), required to color (or equivalently to

duction from Partial 2-grid Coloring to `-Coloring on unit disk graphs. In that paper, a reduction is given from

Nevertheless, when a graph G has more than one maximal sequence corresponding to partitions of its vertex set into cliques, the optimal solution for the cluster deletion problem of

Om deze reden werd deze studie in 2016 gelanceerd door het College Radiologie om op zowel de data van 2011 als van 2015 een uitgebreide analyse van de dosis uit te voeren voor CT

We develop a reduction memetic algorithm (RMA) for the graph coloring problem, a feasible and infeasible search algorithm (FISA) for the equitable coloring problem, an adaptive

- Territoire à Energie Positive pour la Croissance Verte (TEPCV) avec le Ministère de l’Environnement - Contrat d’Objectifs Territoire Energie Climat (COTEC) avec l’ADEME?.

Although the coloring problem is polynomial in interval graphs (since an interval graph is a chordal graph), in [4], it is proved that the Weighted Coloring problem is strongly NP-

Although the coloring problem is polynomial in interval graphs (since an interval graph is a chordal graph), in [4], it is proved that the Weighted Coloring problem is strongly NP-

There are other types of graph coloring, in particular the edge coloring problem is the problem of coloring the edges of a graph with a minimum number of colors such that no two

Furthermore, the mixed graph vertex coloring problem is a generalization of the usual coloring problem in unoriented graphs, and it has been shown to be N P -complete even in