A flow model based on polylinking system.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 1, doi. 10.1007/s10107-011-0446-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2012 AND VI 135 AND IP 1/2
Results: 19
1
2
Cone superadditivity of discrete convex functions.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 25, doi. 10.1007/s10107-011-0447-1
- By:
- Publication type:
- Article
3
Mixing polyhedra with two non divisible coefficients.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 45, doi. 10.1007/s10107-011-0448-0
- By:
- Publication type:
- Article
4
A primal-dual interior point method for nonlinear semidefinite programming.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 89, doi. 10.1007/s10107-011-0449-z
- By:
- Publication type:
- Article
5
A hard integer program made easy by lexicography.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 509, doi. 10.1007/s10107-011-0450-6
- By:
- Publication type:
- Article
6
An augmented Lagrangian approach for sparse principal component analysis.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 149, doi. 10.1007/s10107-011-0452-4
- By:
- Publication type:
- Article
7
On linear and semidefinite programming relaxations for hypergraph matching.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 123, doi. 10.1007/s10107-011-0451-5
- By:
- Publication type:
- Article
8
An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 195, doi. 10.1007/s10107-011-0454-2
- By:
- Publication type:
- Article
9
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 221, doi. 10.1007/s10107-011-0455-1
- By:
- Publication type:
- Article
10
A relaxed constant positive linear dependence constraint qualification and applications.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 255, doi. 10.1007/s10107-011-0456-0
- By:
- Publication type:
- Article
11
A convex polynomial that is not sos-convex.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 275, doi. 10.1007/s10107-011-0457-z
- By:
- Publication type:
- Article
12
Optimality functions in stochastic programming.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 293, doi. 10.1007/s10107-011-0453-3
- By:
- Publication type:
- Article
13
Vectors in a box.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 323, doi. 10.1007/s10107-011-0474-y
- By:
- Publication type:
- Article
14
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 473, doi. 10.1007/s10107-011-0477-8
- By:
- Publication type:
- Article
15
An effective branch-and-bound algorithm for convex quadratic integer programming.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 369, doi. 10.1007/s10107-011-0475-x
- By:
- Publication type:
- Article
16
On convergence in mixed integer programming.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 397, doi. 10.1007/s10107-011-0476-9
- By:
- Publication type:
- Article
17
A limited memory steepest descent method.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 413, doi. 10.1007/s10107-011-0479-6
- By:
- Publication type:
- Article
18
Robust resource allocations in temporal networks.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 437, doi. 10.1007/s10107-011-0478-7
- By:
- Publication type:
- Article
19
Structural and algorithmic properties for parametric minimum cuts.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 337, doi. 10.1007/s10107-011-0463-1
- By:
- Publication type:
- Article