The maximum clique interdiction problem
Year of publication: |
2019
|
---|---|
Authors: | Furini, Fabio ; Ljubić, Ivana ; Martin, Sébastien ; San Segundo, Pablo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 277.2019, 1 (16.8.), p. 112-127
|
Subject: | Combinatorial optimization | Interdiction problems | Maximum clique | (Social) Network analysis | Most vital vertices | Soziales Netzwerk | Social network | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Tanınmış, Kübra, (2022)
-
Learning driven three-phase search for the maximum independent union of cliques problem
Lu, Zhi, (2024)
-
A dynamic reformulation heuristic for generalized interdiction problems
Fischetti, Matteo, (2018)
- More ...
-
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio, (2021)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Tighter MIP models for barge container ship routing
Alfandari, Laurent, (2019)
- More ...