default search action
Mathematical Programming, Volume 153
Volume 153, Number 1, October 2015
- Volker Kaibel, Rekha R. Thomas:
Lifts of convex sets in optimization. 1-3 - Michel X. Goemans:
Smallest compact formulation for the permutahedron. 5-11 - Michele Conforti, Bert Gerards, Kanstantsin Pashkovich:
Stable sets and graphs with no even holes. 13-39 - Hamza Fawzi, Pablo A. Parrilo
:
Lower bounds on nonnegative rank via nonnegative nuclear norms. 41-66 - Yaroslav Shitov:
Tropical lower bounds for extended formulations. 67-74 - Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, nonnegative factorizations, and randomized communication protocols. 75-94 - David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes. 95-115 - Samuel Fiorini, Kanstantsin Pashkovich:
Uncapacitated flow-based extended formulations. 117-131 - Hamza Fawzi, João Gouveia
Positive semidefinite rank. 133-177 - Jop Briët, Daniel Dadush
On the existence of 0/1 polytopes with high semidefinite extension complexity. 179-199 - João Gouveia
Worst-case results for positive semidefinite rank. 201-212 - Tim Netzer
Smooth hyperbolicity cones are spectrahedral shadows. 213-221 - Mario Kummer
Hyperbolic polynomials, interlacers, and sums of squares. 223-245 - Jiawang Nie:
Linear optimization with cones of moments and nonnegative polynomials. 247-274
Volume 153, Number 2, November 2015
- Walter D. Morris Jr.:
Efficient computation of a canonical form for a matrix with the generalized P-property. 275-288 - Tim Carnes, David B. Shmoys
Primal-dual schema for capacitated covering problems. 289-308 - James Saunderson
Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones. 309-331 - Guoyin Li
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors. 333-362 - Richard A. Tapia:
On averaging and representation properties of the BFGS and related secant updates. 363-380 - James R. Lee, Manor Mendel
A node-capacitated Okamura-Seymour theorem. 381-415 - Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck:
An exact combinatorial algorithm for minimum graph bisection. 417-458 - Tsvetan Asamov, Andrzej Ruszczynski:
Time-consistent approximations of risk-averse multistage stochastic optimization problems. 459-493 - Akiyoshi Shioura, Natalia V. Shakhlevich
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. 495-534 - Bo Jiang, Yu-Hong Dai:
A framework of constraint preserving update schemes for optimization on Stiefel manifold. 535-575 - Dimitris Bertsimas, Hoda Bidkhori:
On the performance of affine policies for two-stage adaptive optimization: a geometric perspective. 577-594 - Dimitris Bertsimas, Vishal Gupta
Data-driven estimation in equilibrium using inverse optimization. 595-633 - Dmitriy Drusvyatskiy, Alexander D. Ioffe:
Quadratic growth and critical point stability of semi-algebraic functions. 635-653 - Cristina G. Fernandes
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. 655-685 - Sergei Chubanov:
A polynomial projection algorithm for linear feasibility problems. 687-713 - Bingsheng He, Xiaoming Yuan:
On the convergence rate of Douglas-Rachford operator splitting method. 715-722 - Martin E. Dyer
Erratum to: Computational complexity of stochastic programming problems. 723-725
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-11-15 19:21 CET 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: