Works matching IS 00255610 AND DT 2018 AND VI 167 AND IP 2
Results: 7
Maximum semidefinite and linear extension complexity of families of polytopes.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 381, doi. 10.1007/s10107-017-1134-7
- By:
- Publication type:
- Article
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 435, doi. 10.1007/s10107-017-1136-5
- By:
- Publication type:
- Article
Binary decision rules for multistage adaptive mixed-integer optimization.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 395, doi. 10.1007/s10107-017-1135-6
- By:
- Publication type:
- Article
Critical solutions of nonlinear equations: local attraction for Newton-type methods.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 355, doi. 10.1007/s10107-017-1128-5
- By:
- Publication type:
- Article
Symmetric sums of squares over <italic>k</italic>-subset hypercubes.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 315, doi. 10.1007/s10107-017-1127-6
- By:
- Publication type:
- Article
Chain-constrained spanning trees.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 293, doi. 10.1007/s10107-017-1126-7
- By:
- Publication type:
- Article
Data-driven robust optimization.
- Published in:
- Mathematical Programming, 2018, v. 167, n. 2, p. 235, doi. 10.1007/s10107-017-1125-8
- By:
- Publication type:
- Article