no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A convex polynomial that is not sos-convex
|
Ahmadi, Amir Ali |
|
2011 |
135 |
1-2 |
p. 275-292 |
article |
2 |
A flow model based on polylinking system
|
Goemans, Michel X. |
|
2011 |
135 |
1-2 |
p. 1-23 |
article |
3 |
A hard integer program made easy by lexicography
|
Balas, Egon |
|
2011 |
135 |
1-2 |
p. 509-514 |
article |
4 |
A limited memory steepest descent method
|
Fletcher, Roger |
|
2011 |
135 |
1-2 |
p. 413-436 |
article |
5 |
An augmented Lagrangian approach for sparse principal component analysis
|
Lu, Zhaosong |
|
2011 |
135 |
1-2 |
p. 149-193 |
article |
6 |
An effective branch-and-bound algorithm for convex quadratic integer programming
|
Buchheim, Christoph |
|
2011 |
135 |
1-2 |
p. 369-395 |
article |
7 |
An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
|
Dostál, Zdeněk |
|
2011 |
135 |
1-2 |
p. 195-220 |
article |
8 |
A primal–dual interior point method for nonlinear semidefinite programming
|
Yamashita, Hiroshi |
|
2011 |
135 |
1-2 |
p. 89-121 |
article |
9 |
A relaxed constant positive linear dependence constraint qualification and applications
|
Andreani, Roberto |
|
2011 |
135 |
1-2 |
p. 255-273 |
article |
10 |
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems
|
Álvarez, Felipe |
|
2011 |
135 |
1-2 |
p. 473-507 |
article |
11 |
Cone superadditivity of discrete convex functions
|
Kobayashi, Yusuke |
|
2011 |
135 |
1-2 |
p. 25-44 |
article |
12 |
Mixing polyhedra with two non divisible coefficients
|
Agra, Agostinho |
|
2011 |
135 |
1-2 |
p. 45-87 |
article |
13 |
On convergence in mixed integer programming
|
Del Pia, Alberto |
|
2011 |
135 |
1-2 |
p. 397-412 |
article |
14 |
On linear and semidefinite programming relaxations for hypergraph matching
|
Chan, Yuk Hei |
|
2011 |
135 |
1-2 |
p. 123-148 |
article |
15 |
Optimality functions in stochastic programming
|
Royset, J. O. |
|
2011 |
135 |
1-2 |
p. 293-321 |
article |
16 |
Robust resource allocations in temporal networks
|
Wiesemann, Wolfram |
|
2011 |
135 |
1-2 |
p. 437-471 |
article |
17 |
Structural and algorithmic properties for parametric minimum cuts
|
Granot, Frieda |
|
2011 |
135 |
1-2 |
p. 337-367 |
article |
18 |
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
|
Dash, Sanjeeb |
|
2011 |
135 |
1-2 |
p. 221-254 |
article |
19 |
Vectors in a box
|
Buchin, Kevin |
|
2011 |
135 |
1-2 |
p. 323-335 |
article |