Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
Year of publication: |
2012
|
---|---|
Authors: | Ventresca, Mario |
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. 39.2012, 11, p. 2763-2775
|
Subject: | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Suchtheorie | Search theory |
-
Reactive tabu search in a team-learning problem
Shen, Yuelin, (2008)
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
Efficient local search algorithms for the linear ordering problem
Sakuraba, Celso S., (2010)
- More ...
-
A derandomized approximation algorithm for the critical node detection problem
Ventresca, Mario, (2014)
-
A graph-based ant algorithm for the winner determination problem in combinatorial auctions
Ray, Abhishek, (2021)
-
The bi-objective critical node detection problem
Ventresca, Mario, (2018)
- More ...