Frequency-driven tabu search for the maximum s-plex problem
Year of publication: |
September 2017
|
---|---|
Authors: | Zhou, Yi ; Hao, Jin-Kao |
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. 86.2017, p. 65-78
|
Subject: | Clique relaxation | Heuristic | Massive network | s-plex | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
An efficient new heuristic for the hoist scheduling problem
El Amraoui, Adnen, (2016)
-
Pape, Tom, (2015)
-
A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Gerstl, Enrique, (2013)
- More ...
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
Lu, Zhi, (2019)
-
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi, (2018)
- More ...