The maximum ratio clique problem
Year of publication: |
2015
|
---|---|
Authors: | Sethuraman, Samyukta ; Butenko, Sergiy |
Published in: |
Computational Management Science : CMS. - Berlin : Springer, ISSN 1619-697X, ZDB-ID 2136735-8. - Vol. 12.2015, 1, p. 197-218
|
Subject: | Maximum clique | Fractional combinatorial optimization | Social network analysis | Market graph | Graphentheorie | Graph theory | Soziales Netzwerk | Social network | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
The maximum clique interdiction problem
Furini, Fabio, (2019)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
-
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor, (2018)
- More ...
-
An integer programming approach for fault-tolerant connected dominating sets
Buchanan, Austin, (2015)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
-
Soccer analytics using touch-by-touch match data
Butenko, Sergiy, (2014)
- More ...