default search action
Mathematical Programming Computation, Volume 5
Volume 5, Number 1, March 2013
- Anders Skajaa, Erling D. Andersen, Yinyu Ye:
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems. 1-25 - Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The time dependent traveling salesman problem: polyhedra and algorithm. 27-55 - Matthias Walter, Klaus Truemper:
Implementation of a unimodularity test. 57-73 - Ismael R. de Farias Jr., Ernee Kozyreff, R. Gupta, Ming Zhao:
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. 75-112
Volume 5, Number 2, June 2013
- Nicholas I. M. Gould, Dominique Orban, Daniel P. Robinson:
Trajectory-following methods for large-scale degenerate convex quadratic programming. 113-142 - Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb:
Efficient block-coordinate descent algorithms for the Group Lasso. 143-169 - Vasek Chvátal, William J. Cook, Daniel G. Espinoza:
Local cuts for mixed-integer programming. 171-200 - Benjamin Recht, Christopher Ré:
Parallel stochastic gradient algorithms for large-scale matrix completion. 201-226
Volume 5, Number 3, September 2013
- Christian Kirches, Sven Leyffer:
TACO: a toolkit for AMPL control optimization. 227-265 - Jeffrey D. Blanchard, Jared Tanner:
GPU accelerated greedy algorithms for compressed sensing. 267-304 - William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
A hybrid branch-and-bound approach for exact rational mixed-integer programming. 305-344
Volume 5, Number 4, December 2013
- Gérard Cornuéjols, François Margot, Giacomo Nannicini:
On the safety of Gomory cut generators. 345-395 - Yongjia Song, James R. Luedtke:
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. 397-432
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.