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 | Heuristik | Theorie | Theory | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Schönberger, Jörn, (2015)
-
Luong Thuan Thanh, (2016)
-
Scalability of using restricted Boltzmann machines for combinatorial optimization
Probst, Malte, (2017)
- More ...
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
Ren, Jintong, (2023)
-
Shang, Zhen, (2023)
- More ...