A memetic algorithm for the Minimum Sum Coloring Problem
Year of publication: |
2014
|
---|---|
Authors: | Jin, Yan ; Hao, Jin-Kao ; Hamiez, Jean-Philippe |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 43.2014, p. 318-327
|
Subject: | Sum coloring | Memetic algorithm | Heuristics | Combinatorial optimization | Theorie | Theory | Heuristik | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Selected variants of a Memetic Algorithm for JSP : a comparative study
Boryczka, Urszula, (2019)
-
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles, (2015)
-
Long term production planning of open pit mines by ant colony optimization
Shishvan, Masoud Soleymani, (2015)
- More ...
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Jin, Yan, (2017)
-
Eaddy, LaShonda Louallen, (2018)
- More ...