Mathematical Programming, Volume 112

Volume 112, Number 1, March 2008

Alfredo N. Iusem, Abilio Lucena, Nelson Maculan:
Preface. 1
Electronic Edition (link) BibTeX
Gérard Cornuéjols:
Valid inequalities for mixed integer linear programs. 3-44
Electronic Edition (link) BibTeX
Satoru Iwata:
Submodular function minimization. 45-64
Electronic Edition (link) BibTeX
Jean B. Lasserre:
A semidefinite programming approach to the generalized problem of moments. 65-92
Electronic Edition (link) BibTeX
Roberto Andreani, José Mario Martínez, Leandro Martínez, Flávio Yano:
Continuous optimization methods for structure alignments. 93-124
Electronic Edition (link) BibTeX
Aharon Ben-Tal, Arkadi Nemirovski:
Selected topics in robust convex optimization. 125-158
Electronic Edition (link) BibTeX
Yu. Nesterov:
Accelerating the cubic regularization of Newton's method on convex problems. 159-181
Electronic Edition (link) BibTeX
Alexander Shapiro:
Stochastic programming approach to optimization under uncertainty. 183-220
Electronic Edition (link) BibTeX
Kim-Chuan Toh:
An inexact primal-dual path following algorithm for convex quadratic SDP. 221-254
Electronic Edition (link) BibTeX
Robert J. Vanderbei:
Extreme optics and the search for Earth-like planets. 255-272
Electronic Edition (link) BibTeX
L. M. Graña Drummond, Nelson Maculan, Benar Fux Svaiter:
On the choice of parameters for the weighting method in vector optimization. 273
Electronic Edition (link) BibTeX

Timothy A. Davis, William W. Hager:
A sparse proximal implementation of the LP dual active set algorithm. 275-301
Electronic Edition (link) BibTeX
David Avis, Hiroshi Imai, Tsuyoshi Ito:
Generating facets for the cut polytope of a graph by triangular elimination. 303-325
Electronic Edition (link) BibTeX
Walter F. Mascarenhas:
Newton's iterates can converge to non-stationary points. 327-334
Electronic Edition (link) BibTeX
Giovanni Giallombardo, Daniel Ralph:
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs. 335-369
Electronic Edition (link) BibTeX
B. Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone:
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. 371-401
Electronic Edition (link) BibTeX
Timothy A. Davis, William W. Hager:
Dual multilevel optimization. 403-425
Electronic Edition (link) BibTeX
Uwe Naumann:
Optimal Jacobian accumulation is NP-complete. 427-441
Electronic Edition (link) BibTeX
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
Electronic Edition (link) BibTeX
Krzysztof C. Kiwiel:
Breakpoint searching algorithms for the continuous quadratic knapsack problem. 473-491
Electronic Edition (link) BibTeX