Pages that link to "Item:Q1106665"
From MaRDI portal
The following pages link to Geometric optimization and \(D^ P\)-completeness (Q1106665):
Displaying 8 items.
- Optimality criteria for general unconstrained geometric programming problems (Q811403) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- The algebraic degree of geometric optimization problems (Q1104865) (← links)
- Geometry of optimal value functions with applications to redundancy in linear programming (Q1331104) (← links)
- Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
- Some easy and some not so easy geometric optimization problems (Q1757753) (← links)
- Geometric minimization under external equivalence for implicit descriptions (Q1898498) (← links)
- (Q4852904) (← links)