Pages that link to "Item:Q948960"
From MaRDI portal
The following pages link to FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960):
Displaying 11 items.
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- An FPTAS for a general class of parametric optimization problems (Q2300026) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Portfolio-optimization models for small investors (Q2392807) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization (Q5499737) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)