The following pages link to (Q3754444):
Displaying 4 items.
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- An implicit enumeration method for global optimization problems (Q2641085) (← links)