default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 112
Volume 112, Number 1, March 2008
- Alfredo N. Iusem, Abilio Lucena, Nelson Maculan:
Preface. 1 - Gérard Cornuéjols:
Valid inequalities for mixed integer linear programs. 3-44 - Satoru Iwata:
Submodular function minimization. 45-64 - Jean B. Lasserre
:
A semidefinite programming approach to the generalized problem of moments. 65-92 - Roberto Andreani, José Mario Martínez, Leandro Martínez, Flávio S. Yano:
Continuous optimization methods for structure alignments. 93-124 - Aharon Ben-Tal, Arkadi Nemirovski:
Selected topics in robust convex optimization. 125-158 - Yurii E. Nesterov:
Accelerating the cubic regularization of Newton's method on convex problems. 159-181 - Alexander Shapiro:
Stochastic programming approach to optimization under uncertainty. 183-220 - Kim-Chuan Toh:
An inexact primal-dual path following algorithm for convex quadratic SDP. 221-254 - Robert J. Vanderbei:
Extreme optics and the search for Earth-like planets. 255-272 - L. Mauricio Graña Drummond, Nelson Maculan, Benar Fux Svaiter:
On the choice of parameters for the weighting method in vector optimization. 273
Volume 112, Number 2, April 2008
- Timothy A. Davis, William W. Hager:
A sparse proximal implementation of the LP dual active set algorithm. 275-301 - David Avis, Hiroshi Imai, Tsuyoshi Ito:
Generating facets for the cut polytope of a graph by triangular elimination. 303-325 - Walter F. Mascarenhas:
Newton's iterates can converge to non-stationary points. 327-334 - Giovanni Giallombardo, Daniel Ralph:
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs. 335-369 - Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone:
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. 371-401 - Timothy A. Davis, William W. Hager:
Dual multilevel optimization. 403-425 - Uwe Naumann:
Optimal Jacobian accumulation is NP-complete. 427-441 - Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade:
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. 443-472 - Krzysztof C. Kiwiel:
Breakpoint searching algorithms for the continuous quadratic knapsack problem. 473-491
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-12-26 00:36 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:
