A new branch-and-bound algorithm for the maximum edge-weighted clique problem
Year of publication: |
2019
|
---|---|
Authors: | San Segundo, Pablo ; Coniglio, Stefano ; Furini, Fabio ; Ljubić, Ivana |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 278.2019, 1 (1.10.), p. 76-90
|
Subject: | Combinatorial optimization | Branch-and-bound | Maximum edge-weighted clique problem | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Jin, Bo, (2023)
-
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep, (2020)
-
Morrison, David Robert, (2014)
- More ...
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
The maximum clique interdiction problem
Furini, Fabio, (2019)
-
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio, (2021)
- More ...