Handelman’s hierarchy for the maximum stable set problem
Year of publication: |
2014
|
---|---|
Authors: | Laurent, Monique ; Sun, Zhao |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 60.2014, 3, p. 393-423
|
Publisher: |
Springer |
Subject: | Polynomial optimization | Combinatorial optimization | Handelman hierarchy | Linear programming relaxation | The maximum stable set problem |
-
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
Park, Myoung-Ju, (2013)
-
The multi-resource agent bottleneck generalised assignment problem
Karsu, Özlem, (2012)
-
A disassembly line balancing problem with fixed number of workstations
Kalaycılar, Eda Göksoy, (2016)
- More ...
-
Bound-constrained polynomial optimization using only elementary calculations
Klerk, Etienne de, (2017)
-
Polynomial optimization : error analysis and applications
Sun, Zhao, (2015)
-
Through-the-Cycle EDF Credit Measures
Hamilton, David T., (2011)
- More ...