Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 137
Volume 137, Numbers 1-2, February 2013
- Abdo Y. Alfakih, Nicole Taheri, Yinyu Ye:
On stress matrices of (d + 1)-lateration frameworks in general position. 1-17 - Egon Balas, François Margot:
Generalized intersection cuts and a new cut generating paradigm. 19-35 - Guoyin Li
:
Global error bounds for piecewise convex polynomials. 37-64 - Richard Bödi, Katrin Herr, Michael Joswig:
Algorithms for highly symmetric linear and integer programs. 65-90 - Hédy Attouch, Jérôme Bolte, Benar Fux Svaiter:
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. 91-129 - Hongbo Dong, Kurt M. Anstreicher:
Separating doubly nonnegative and completely positive matrices. 131-153 - Roger Behling, Alfredo N. Iusem:
The effect of calmness on the solution set of systems of nonlinear equations. 155-165 - Steve Zymler, Daniel Kuhn, Berç Rustem:
Distributionally robust joint chance constraints with second-order moment information. 167-198 - Damián R. Fernández:
A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems. 199-223 - Jiawang Nie:
An exact Jacobian SDP relaxation for polynomial optimization. 225-255 - Tim Hoheisel, Christian Kanzow, Alexandra Schwartz:
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. 257-288 - Richard H. Byrd, Jorge Nocedal, Richard A. Waltz, Yuchen Wu:
On the use of piecewise linear models in nonlinear programming. 289-324 - Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
n-Fold integer programming in cubic time. 325-341 - Samuel Burer, Hongbo Dong:
Separation and relaxation for cones of quadratic forms. 343-370 - Aida Khajavirad, Nikolaos V. Sahinidis:
Convex envelopes generated from finitely many compact convex sets. 371-408 - Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
Improved lower bounds and exact algorithm for the capacitated arc routing problem. 409-452 - Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis:
NP-hardness of deciding convexity of quartic polynomials and related problems. 453-476 - Antonio M. Rodríguez-Chía, C. Valero-Franco:
On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ p distances for p > 2. 477-502 - Hiroshi Hirai:
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees. 503-530 - William W. Hager, Dzung T. Phan, Hongchao Zhang:
An exact algorithm for graph partitioning. 531-556 - Sabine Burgdorf, Kristijan Cafuta, Igor Klep, Janez Povh:
The tracial moment problem and trace-optimization of polynomials. 557-578 - Tomonari Kitahara, Shinji Mizuno:
A bound for the number of different basic solutions generated by the simplex method. 579-586 - Paul Armand, Joël Benoist:
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods. 587-592 - Manfred Padberg:
The rank of (mixed-) integer polyhedra. 593-599 - Satoru Fujishige:
A note on polylinking flow networks. 601-607
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-03 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
