A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem

Seyedmohammadhossein Hosseinian,Dalila B. M. M. Fontes,Sergiy Butenko

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem

2020

Seyedmohammadhossein Hosseinian
Dalila B. M. M. Fontes
Sergiy Butenko

This paper explores the connections between the classical maximum clique problem and its edge-weighted generalization, the maximum edge weight clique (MEWC) problem. As a result, a new analytic upp...

Keywords:

clique number
Discrete mathematics
Lagrangian
Mathematics
Exact algorithm
Clique problem
Clique
Graph theory

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations