| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A bound for the number of different basic solutions generated by the simplex method
|
Kitahara, Tomonari
|
|
2011
|
137 |
1-2 |
p. 579-586
|
article
|
| 2 |
Algorithms for highly symmetric linear and integer programs
|
Bödi, Richard
|
|
2011
|
137 |
1-2 |
p. 65-90
|
article
|
| 3 |
An exact algorithm for graph partitioning
|
Hager, William W.
|
|
2011
|
137 |
1-2 |
p. 531-556
|
article
|
| 4 |
An exact Jacobian SDP relaxation for polynomial optimization
|
Nie, Jiawang
|
|
2011
|
137 |
1-2 |
p. 225-255
|
article
|
| 5 |
A note on polylinking flow networks
|
Fujishige, Satoru
|
|
2011
|
137 |
1-2 |
p. 601-607
|
article
|
| 6 |
A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems
|
Fernández, Damián
|
|
2011
|
137 |
1-2 |
p. 199-223
|
article
|
| 7 |
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
|
Attouch, Hedy
|
|
2011
|
137 |
1-2 |
p. 91-129
|
article
|
| 8 |
Convex envelopes generated from finitely many compact convex sets
|
Khajavirad, Aida
|
|
2011
|
137 |
1-2 |
p. 371-408
|
article
|
| 9 |
Distributionally robust joint chance constraints with second-order moment information
|
Zymler, Steve
|
|
2011
|
137 |
1-2 |
p. 167-198
|
article
|
| 10 |
Generalized intersection cuts and a new cut generating paradigm
|
Balas, Egon
|
|
2011
|
137 |
1-2 |
p. 19-35
|
article
|
| 11 |
Global error bounds for piecewise convex polynomials
|
Li, Guoyin
|
|
2011
|
137 |
1-2 |
p. 37-64
|
article
|
| 12 |
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
|
Hirai, Hiroshi
|
|
2011
|
137 |
1-2 |
p. 503-530
|
article
|
| 13 |
Improved lower bounds and exact algorithm for the capacitated arc routing problem
|
Bartolini, Enrico
|
|
2011
|
137 |
1-2 |
p. 409-452
|
article
|
| 14 |
n-Fold integer programming in cubic time
|
Hemmecke, Raymond
|
|
2011
|
137 |
1-2 |
p. 325-341
|
article
|
| 15 |
NP-hardness of deciding convexity of quartic polynomials and related problems
|
Ahmadi, Amir Ali
|
|
2011
|
137 |
1-2 |
p. 453-476
|
article
|
| 16 |
On stress matrices of (d + 1)-lateration frameworks in general position
|
Alfakih, A. Y.
|
|
2011
|
137 |
1-2 |
p. 1-17
|
article
|
| 17 |
On the global convergence of a generalized iterative procedure for the minisum location problem with ℓp distances for p > 2
|
Rodríguez-Chía, A. M.
|
|
2011
|
137 |
1-2 |
p. 477-502
|
article
|
| 18 |
On the use of piecewise linear models in nonlinear programming
|
Byrd, Richard H.
|
|
2011
|
137 |
1-2 |
p. 289-324
|
article
|
| 19 |
Separating doubly nonnegative and completely positive matrices
|
Dong, Hongbo
|
|
2011
|
137 |
1-2 |
p. 131-153
|
article
|
| 20 |
Separation and relaxation for cones of quadratic forms
|
Burer, Samuel
|
|
2011
|
137 |
1-2 |
p. 343-370
|
article
|
| 21 |
The effect of calmness on the solution set of systems of nonlinear equations
|
Behling, Roger
|
|
2011
|
137 |
1-2 |
p. 155-165
|
article
|
| 22 |
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
|
Hoheisel, Tim
|
|
2011
|
137 |
1-2 |
p. 257-288
|
article
|
| 23 |
The rank of (mixed-) integer polyhedra
|
Padberg, Manfred W.
|
|
2011
|
137 |
1-2 |
p. 593-599
|
article
|
| 24 |
The tracial moment problem and trace-optimization of polynomials
|
Burgdorf, Sabine
|
|
2011
|
137 |
1-2 |
p. 557-578
|
article
|
| 25 |
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
|
Armand, Paul
|
|
2011
|
137 |
1-2 |
p. 587-592
|
article
|
Journal description