On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Chu-Min Li, Hua Jiang, Felip Manyà
| Year of publication: |
August 2017
|
|---|---|
| Authors: | Li, Chu-Min ; Jiang, Hua ; Manyà, Felip |
| 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. 84.2017, p. 1-15
|
| Subject: | Maximum clique problem | Branch-and-bound | Branching ordering | Incremental MaxSAT Reasoning | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2017.02.017 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011710166