Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference17 articles.
1. Bodlaender, H.L., Gritzmann, P., Klee, V., van Leeuwen, J.: Computational complexity of norm maximization. Combinatorica 10, 203–225 (1990)
2. Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113–119 (1996)
3. Nesterov, Y.: Random walk in a simplex and quadratic optimization over convex polytopes. CORE Discussion paper 2003/71, CORE-UCL (2003)
4. Pardalos, P., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1, 15–22 (1991)
5. Sahni, S.: Computationally related problems. SIAM J. Comput. 3, 267–279 (1974)