Pages that link to "Item:Q1906280"
From MaRDI portal
The following pages link to The complexity of approximating a nonlinear program (Q1906280):
Displayed 8 items.
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- On the advantage over a random assignment (Q5894908) (← links)