Infra-chromatic bound for exact maximum clique search
Year of publication: |
2014
|
---|---|
Authors: | San Segundo, Pablo ; Nikolaev, Alexey ; Batsyn, Mikhail |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 64.2015, p. 293-303
|
Subject: | Approximate coloring | Branch-and-bound | MaxSAT | Combinatorial optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Relaxed approximate coloring in exact maximum clique search
San Segundo, Pablo, (2014)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan, (2016)
- More ...
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
-
An efficient exact model for the cell formation problem with a variable number of production cells
Bychkov, Ilya, (2018)
-
Vehicle assignment in site-dependent vehicle routing problems with split deliveries
Batsyn, Mikhail, (2021)
- More ...