Works matching IS 00255610 AND DT 2008 AND VI 114 AND IP 1
Results: 7
Packing and partitioning orbitopes.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 1, doi. 10.1007/s10107-006-0081-5
- By:
- Publication type:
- Article
Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 69, doi. 10.1007/s10107-006-0083-3
- By:
- Publication type:
- Article
A $${\mathsf{D}}$$ -induced duality and its applications.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 149, doi. 10.1007/s10107-007-0097-5
- By:
- Publication type:
- Article
Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 37, doi. 10.1007/s10107-006-0082-4
- By:
- Publication type:
- Article
A simple polynomial-time rescaling algorithm for solving linear programs.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 101, doi. 10.1007/s10107-007-0095-7
- By:
- Publication type:
- Article
Approximation algorithms for general packing problems and their application to the multicast congestion problem.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 183, doi. 10.1007/s10107-007-0106-8
- By:
- Publication type:
- Article
Efficient robust optimization for robust control with constraints.
- Published in:
- Mathematical Programming, 2008, v. 114, n. 1, p. 115, doi. 10.1007/s10107-007-0096-6
- By:
- Publication type:
- Article