Implicit solution function of P and Z matrix linear complementarity constraints.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 1, doi. 10.1007/s10107-009-0291-8
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2011 AND VI 128 AND IP 1/2
Results: 17
1
2
Maximizing a class of submodular utility functions.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 149, doi. 10.1007/s10107-009-0298-1
- By:
- Publication type:
- Article
3
Recognizing conic TDI systems is hard.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 43, doi. 10.1007/s10107-009-0294-5
- By:
- Publication type:
- Article
4
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 49, doi. 10.1007/s10107-009-0295-4
- By:
- Publication type:
- Article
5
An interior-point piecewise linear penalty method for nonlinear programming.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 73, doi. 10.1007/s10107-009-0296-3
- By:
- Publication type:
- Article
6
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 123, doi. 10.1007/s10107-009-0297-2
- By:
- Publication type:
- Article
7
On the exact separation of mixed integer knapsack cuts.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 19, doi. 10.1007/s10107-009-0284-7
- By:
- Publication type:
- Article
8
A large class of facets for the K-median polytope.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 171, doi. 10.1007/s10107-009-0301-x
- By:
- Publication type:
- Article
9
On the separation of disjunctive cuts.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 205, doi. 10.1007/s10107-009-0300-y
- By:
- Publication type:
- Article
10
A robustification approach in unconstrained quadratic optimization.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 231, doi. 10.1007/s10107-009-0302-9
- By:
- Publication type:
- Article
11
New results on Hermitian matrix rank-one decomposition.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 253, doi. 10.1007/s10107-009-0304-7
- By:
- Publication type:
- Article
12
Combining and scaling descent and negative curvature directions.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 285, doi. 10.1007/s10107-009-0305-6
- By:
- Publication type:
- Article
13
Fixed point and Bregman iterative methods for matrix rank minimization.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 321, doi. 10.1007/s10107-009-0306-5
- By:
- Publication type:
- Article
14
Budgeted matching and budgeted matroid intersection via the gasoline puzzle.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 355, doi. 10.1007/s10107-009-0307-4
- By:
- Publication type:
- Article
15
On the structure of the solution set for the single facility location problem with average distances.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 373, doi. 10.1007/s10107-009-0308-3
- By:
- Publication type:
- Article
16
Approximation of linear fractional-multiplicative problems.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 437, doi. 10.1007/s10107-009-0309-2
- By:
- Publication type:
- Article
17
Branching on general disjunctions.
- Published in:
- Mathematical Programming, 2011, v. 128, n. 1/2, p. 403, doi. 10.1007/s10107-009-0332-3
- By:
- Publication type:
- Article