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 | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming |
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
A strong integer programming formulation for hybrid flowshop scheduling
Ünal, A. Tamer, (2020)
-
A quest for a fair schedule : the young physicists' tournament
Cechlárová, Katarína, (2020)
- More ...
-
Structural Change in Ethiopia : An Employment Perspective
Martins, Pedro S., (2014)
-
Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?
Bektaş, Tolga, (2014)
-
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem
Catanzaro, Daniele, (2015)
- More ...