The bi-objective critical node detection problem
Year of publication: |
16 March 2018
|
---|---|
Authors: | Ventresca, Mario ; Harrison, Kyle Robert ; Ombuki-Berman, Beatrice M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 3 (16.3.), p. 895-908
|
Subject: | Networks | Critical node detection | Multi-objective | Evolutionary algorithms | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Netzwerk | Network | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Scheduling-Verfahren | Scheduling problem |
-
Scenario-based multi-objective robust scheduling for a semiconductor production line
Liu, Juan, (2019)
-
Yang, Li-Jun, (2023)
-
Modified MapReduce for efficient data management : a task scheduling technique
Rajeswari, D., (2024)
- 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)
-
Ventresca, Mario, (2012)
- More ...