The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Year of publication: |
2008
|
---|---|
Authors: | Klerk, Etienne |
Published in: |
Central European Journal of Operations Research. - Springer. - Vol. 16.2008, 2, p. 111-125
|
Publisher: |
Springer |
Subject: | Computational complexity | Global optimization | Linear and semidefinite programming | Approximation algorithms |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey
de Klerk, Etienne, (2006)
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2003)
-
Complexity and approximation of the connected set-cover problem
Zhang, Wei, (2012)
- More ...