A new upper bound for the maximum weight clique problem
| Year of publication: |
1 October 2018
|
|---|---|
| Authors: | Li, Chu-Min ; Liu, Yanli ; Jiang, Hua ; ManyĆ , Felip ; Li, Yu |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 1 (1.10.), p. 66-77
|
| Subject: | Combinatorial optimization | Branch and bound | Maximum weight clique problem | Upper bound | Weight cover | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem |
-
Zhang, Yurong, (2025)
-
Zhang, Wenda, (2021)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
Li, Chu-Min, (2017)
-
Solving longest common subsequence problems via a transformation to the maximum clique problem
Blum, Christian, (2021)
-
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Zhou, Jianrong, (2023)
- More ...