Numerical experiments with LP formulations of the maximum clique problem
Year of publication: |
2022
|
---|---|
Authors: | Kardos, Dóra ; Patassy, Patrik ; Szabó, Sándor ; Zaválnij, Bogdán |
Published in: |
Central European journal of operations research. - Heidelberg : Physica-Verl., ISSN 1613-9178, ZDB-ID 2093829-9. - Vol. 30.2022, 4, p. 1353-1367
|
Subject: | Combinatorial optimization | Greedy coloring | LP relaxation bounds | Maximum clique problem | Practical solutions of NP complete problems | Zero-one linear programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
Li, Chu-Min, (2017)
-
Faria, Alexandre Frias, (2021)
- More ...
-
Változtatási szándékok és várható eredmények az EGK mezőgazdasági politikájában
Szabó, Sándor, (1984)
-
A clique search problem and its application to machine scheduling
Szabó, Sándor, (2021)
-
Szabó, Sándor, (2021)
- More ...