Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Year of publication: |
2015
|
---|---|
Authors: | Gouveia, Luis ; Martins, Pedro |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 3.2015, 1, p. 1-30
|
Subject: | Maximum edge-weight clique problem | Clique's edge neighborhood | Integer formulations | Sparse graphs | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
MarĂn, Alfredo, (2015)
- More ...
-
Structural Change in Ethiopia : An Employment Perspective
Martins, Pedro, (2014)
-
Models for a traveling purchaser problem with additional side-constraints
Gouveia, Luis, (2011)
-
Gouveia, Luis, (2011)
- More ...