Continuous quadratic programming formulations of optimization problems on graphs
Year of publication: |
2015
|
---|---|
Authors: | Hager, William W. ; Hungerford, James T. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 240.2015, 2 (16.1.), p. 328-337
|
Subject: | Vertex separator | Graph partitioning | Maximum clique | Continuous formulation | Quadratic programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Continuous quadratic programming formulations of optimization problems on graphs
Hager, William W., (2015)
-
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo, (2016)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
- More ...
-
Continuous quadratic programming formulations of optimization problems on graphs
Hager, William W., (2015)
-
A general regularized continuous formulation for the maximum clique problem
Hungerford, James T., (2019)
-
Self-adaptive inexact proximal point methods
Hager, William W., (2008)
- More ...