Construct, merge, solve & adapt a new general algorithm for combinatorial optimization
Year of publication: |
April 2016
|
---|---|
Authors: | Blum, Christian ; Pinachio, Pedro ; López-Ibáñez, Manuel ; Lozano, Jose A. |
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. 68.2016, p. 75-88
|
Subject: | Metaheuristics | Exact solver | Hybrid algorithms | Minimum common string partition | Minimum covering arborescence | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
A tabu search/path relinking algorithm to solve the job shop scheduling problem
Peng, Bo, (2015)
-
Firefly Algorithm with non-homogeneous population : a case study in economic load dispatch problem
Kapelinski, Kléber, (2021)
-
Research trends in combinatorial optimization
Weinand, Jann Michael, (2022)
- More ...
-
Pinacho Davidson, Pedro, (2018)
-
Mathematical programming strategies for solving the minimum common string partition problem
Blum, Christian, (2015)
-
Beam-ACO for the travelling salesman problem with time windows
López-Ibáñez, Manuel, (2010)
- More ...