default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 143
Volume 143, Numbers 1-2, February 2014
- Aharon Ben-Tal, Dick den Hertog:
Hidden conic quadratic representation of some nonconvex quadratic optimization problems. 1-29 - Hailin Sun
, Huifu Xu:
Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints. 31-59 - Nathan Krislock, Jérôme Malick, Frédéric Roupin:
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. 61-86 - Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi:
Coordinated cutting plane generation via multi-objective separation. 87-110 - Quentin Louveaux, Laurent Poirrier:
An algorithm for the separation of two-row cuts. 111-146 - Marius Durea, Radu Strugariu:
Chain rules for linear openness in metric spaces and applications. 147-176 - Juan Pablo Luna, Claudia A. Sagastizábal, Mikhail V. Solodov:
A class of Dantzig-Wolfe type decomposition methods for variational inequality problems. 177-209 - Julia Sponsel, Mirjam Dür:
Factorization and cutting planes for completely positive matrices by copositive projection. 211-229 - Samuel Burer, Adam N. Letchford:
Unbounded convex sets for non-convex mixed-integer quadratic programming. 231-256 - Frank Fischer, Christoph Helmberg:
Dynamic graph generation for the shortest path problem in time expanded networks. 257-297 - Brendan P. W. Ames, Stephen A. Vavasis:
Convex optimization for the planted k-disjoint-clique problem. 299-337 - Kenneth Lange, Hua Zhou:
MM algorithms for geometric and signomial programming. 339-356 - Edward D. Kim:
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture. 357-370 - Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye:
Complexity of unconstrained $$L_2-L_p$$ minimization. 371-383
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 2025-02-18 01:18 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:
