A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Year of publication: |
2020
|
---|---|
Authors: | Hosseinian, Seyedmohammadhossein ; Fontes, Dalila B. M. M. ; Butenko, Sergiy |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 3, p. 747-762
|
Subject: | graph theory | analytic upper bound on the clique number | maximum edge weight clique problem | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
- More ...
-
Combination chemotherapy optimization with discrete dosing
Ajayi, Temitayo, (2024)
-
Multicriteria Decision Making: A Case Study in the Automobile Industry
Oliveira, Márcia, (2013)
-
Homayouni, S. Mahdi, (2020)
- More ...