Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
This paper studies the behavior of compact formulations for solving the maximum edge-weight clique (MEWC) problem in sparse graphs. The MEWC problem has long been discussed in the literature, but mostly addressing complete graphs, with or without a cardinality constraint on the clique. Yet, several...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2015
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/0a6373af69784e349f43270e8714b1ae |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|