On stress matrices of (d + 1)-lateration frameworks in general position A. Y. AlfakihNicole TaheriYinyu Ye Full Length Paper 03 August 2011 Pages: 1 - 17
Generalized intersection cuts and a new cut generating paradigm Egon BalasFrançois Margot Full Length Paper 12 August 2011 Pages: 19 - 35
Global error bounds for piecewise convex polynomials Guoyin Li Full Length Paper 04 August 2011 Pages: 37 - 64
Algorithms for highly symmetric linear and integer programs Richard BödiKatrin HerrMichael Joswig Full Length Paper 25 September 2011 Pages: 65 - 90
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods Hedy AttouchJérôme BolteBenar Fux Svaiter Full Length Paper 20 August 2011 Pages: 91 - 129
Separating doubly nonnegative and completely positive matrices Hongbo DongKurt Anstreicher Full Length Paper 23 August 2011 Pages: 131 - 153
The effect of calmness on the solution set of systems of nonlinear equations Roger BehlingAlfredo Iusem Full Length Paper 15 September 2011 Pages: 155 - 165
Distributionally robust joint chance constraints with second-order moment information Steve ZymlerDaniel KuhnBerç Rustem Full Length Paper 10 November 2011 Pages: 167 - 198
A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems Damián Fernández Full Length Paper 08 October 2011 Pages: 199 - 223
An exact Jacobian SDP relaxation for polynomial optimization Jiawang Nie Full Length Paper 22 September 2011 Pages: 225 - 255
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints Tim HoheiselChristian KanzowAlexandra Schwartz Full Length Paper 27 September 2011 Pages: 257 - 288
On the use of piecewise linear models in nonlinear programming Richard H. ByrdJorge NocedalYuchen Wu Full Length Paper 12 October 2011 Pages: 289 - 324
n-Fold integer programming in cubic time Raymond HemmeckeShmuel OnnLyubov Romanchuk Full Length Paper 30 September 2011 Pages: 325 - 341
Separation and relaxation for cones of quadratic forms Samuel BurerHongbo Dong Full Length Paper 28 October 2011 Pages: 343 - 370
Convex envelopes generated from finitely many compact convex sets Aida KhajaviradNikolaos V. Sahinidis Full Length Paper 28 October 2011 Pages: 371 - 408
Improved lower bounds and exact algorithm for the capacitated arc routing problem Enrico BartoliniJean-François CordeauGilbert Laporte Full Length Paper 03 November 2011 Pages: 409 - 452
NP-hardness of deciding convexity of quartic polynomials and related problems Amir Ali AhmadiAlex OlshevskyJohn N. Tsitsiklis Full Length Paper 30 November 2011 Pages: 453 - 476
On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ p distances for p > 2 A. M. Rodríguez-ChíaC. Valero-Franco Full Length Paper 11 November 2011 Pages: 477 - 502
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees Hiroshi Hirai Full Length Paper 15 December 2011 Pages: 503 - 530
An exact algorithm for graph partitioning William W. HagerDzung T. PhanHongchao Zhang Full Length Paper 30 November 2011 Pages: 531 - 556
The tracial moment problem and trace-optimization of polynomials Sabine BurgdorfKristijan CafutaJanez Povh Full Length Paper 16 December 2011 Pages: 557 - 578
A bound for the number of different basic solutions generated by the simplex method Tomonari KitaharaShinji Mizuno Short Communication 03 August 2011 Pages: 579 - 586
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods Paul ArmandJoël Benoist Short Communication 05 November 2011 Pages: 587 - 592
The rank of (mixed-) integer polyhedra Manfred W. Padberg Short Communication 05 November 2011 Pages: 593 - 599
A note on polylinking flow networks Satoru Fujishige Short Communication 11 November 2011 Pages: 601 - 607
