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: | Theorie | Theory | Algorithmus | Algorithm |
-
Efficiency versus fairness in link recommendation algorithms
Grabisch, Michel, (2025)
-
Andersson, Tommy, (2022)
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
- More ...
-
A Graph Based Ant Algorithm for the Winner Determination Problem in Combinatorial Auctions
Ray, Abhishek, (2018)
-
A derandomized approximation algorithm for the critical node detection problem
Ventresca, Mario, (2014)
-
The bi-objective critical node detection problem
Ventresca, Mario, (2018)
- More ...