Mathematical Programming
, Volume 122
Volume 122, Number 1, March 2010
Alper Atamtürk
,
Vishnu Narayanan
:
Conic mixed-integer rounding cuts.
1-20
J. William Helton
,
Jiawang Nie
:
Semidefinite representation of convex sets.
21-64
Anhua Lin
:
On a special class of regularized central paths for semidefinite programs.
65-85
S. Thomas McCormick
,
Satoru Fujishige
:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
87-120
Kent Andersen
,
Yves Pochet
:
Coefficient strengthening: a tool for reformulating mixed-integer programs.
121-154
Nicholas I. M. Gould
,
Philippe L. Toint
:
Nonlinear programming without a penalty function or a filter.
155-196
Volume 122, Number 2, April 2010
Florent Cadoux
:
Computing deep facet-defining disjunctive cuts for mixed-integer programming.
197-223
Etienne de Klerk
,
Renata Sotirov
:
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem.
225-246
James Luedtke
,
Shabbir Ahmed
,
George L. Nemhauser
:
An integer programming approach for linear programs with probabilistic constraints.
247-272
Richard H. Byrd
,
Frank E. Curtis
,
Jorge Nocedal
:
An inexact Newton method for nonconvex equality constrained optimization.
273-299
Truong Q. Bao
,
Boris S. Mordukhovich
:
Relative Pareto minimizers for multiobjective problems: existence and optimality conditions.
301-347
Dong Liang
,
Wilbert E. Wilhelm
:
A generalization of column generation to accelerate convergence.
349-378
Jiawang Nie
,
Kristian Ranestad
,
Bernd Sturmfels
:
The algebraic degree of semidefinite programming.
379-405
Last update Mon May 20 02:01:33 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page