The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Year of publication: |
2008
|
---|---|
Authors: | Klerk, Etienne de |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 16.2008, 2, p. 111-125
|
Subject: | Komplexe Systeme | Complex systems | Dynamische Optimierung | Dynamic programming | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
The complexity of optimizing over a simplex, hypercube or sphere : a short survey
Klerk, Etienne de, (2006)
-
Gong, Xiting, (2021)
-
An improved balanced algorithm for the subset-sum problem
Curtis, V. V., (2019)
- More ...
-
On semidefinite programming relaxations of the traveling salesman problem
Klerk, Etienne de, (2008)
-
Klerk, Etienne de, (2006)
-
Klerk, Etienne de, (2009)
- More ...