default search action
Mathematical Programming Computation, Volume 2
Volume 2, Number 1, March 2010
- Samuel Burer:
Optimizing a polyhedral-semidefinite relaxation of completely positive programs. 1-19 - Nicholas I. M. Gould, Daniel P. Robinson, H. Sue Thorne:
On solving trust-region and other regularised subproblems in optimization. 21-57 - Jiming Peng, Hans D. Mittelmann, Xiaoxue Li:
A new relaxation framework for quadratic assignment problems based on matrix splitting. 59-77
Volume 2, Number 2, June 2010
- Chris Groër, Bruce L. Golden, Edward A. Wasil:
A library of local search heuristics for the vehicle routing problem. 79-101 - John A. Gunnels, Jon Lee, Susan Margulies:
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. 103-124 - Tobias Achterberg, Christian Raack:
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs. 125-165
Volume 2, Numbers 3-4, December 2010
- Martin S. Andersen, Joachim Dahl, Lieven Vandenberghe:
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. 167-201 - Zaiwen Wen, Donald Goldfarb, Wotao Yin:
Alternating direction augmented Lagrangian methods for semidefinite programming. 203-230 - Sanjeeb Dash, Marcos Goycoolea:
A heuristic to generate rank-1 GMI cuts. 231-257 - Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão, Rosiane de Freitas Rodrigues:
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. 259-290 - Lu Li, Kim-Chuan Toh:
An inexact interior point method for L 1-regularized sparse covariance selection. 291-315
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.