 | 2012 |
| 18 |  | Samuel Burer,
Hongbo Dong:
Representing quadratically constrained quadratic programs as generalized copositive programs.
Oper. Res. Lett. 40(3): 203-206 (2012) |
| 2010 |
| 17 |  | Kurt M. Anstreicher,
Samuel Burer:
Computable representations for convex hulls of low-dimensional quadratic forms.
Math. Program. 124(1-2): 33-43 (2010) |
| 2009 |
| 16 |  | Samuel Burer:
On the copositive representation of binary and continuous nonconvex quadratic programs.
Math. Program. 120(2): 479-495 (2009) |
| 15 |  | Samuel Burer,
Adam N. Letchford:
On Nonconvex Quadratic Programming with Box Constraints.
SIAM Journal on Optimization 20(2): 1073-1089 (2009) |
| 2008 |
| 14 |  | Samuel Burer,
Philip C. Jones,
Timothy J. Lowe:
Coordinating the supply chain in the agricultural seed industry.
European Journal of Operational Research 185(1): 354-377 (2008) |
| 13 |  | Samuel Burer,
Dieter Vandenbussche:
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.
Math. Program. 113(2): 259-282 (2008) |
| 2007 |
| 12 |  | Samuel Burer,
Jon Lee:
Solving maximum-entropy sampling problems using factored masks.
Math. Program. 109(2-3): 263-281 (2007) |
| 11 |  | Miguel F. Anjos,
Samuel Burer:
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization.
SIAM Journal on Optimization 18(4): 1310-1325 (2007) |
| 2006 |
| 10 |  | Yi Zhang,
Samuel Burer,
W. Nick Street:
Ensemble Pruning Via Semi-definite Programming.
Journal of Machine Learning Research 7: 1315-1338 (2006) |
| 9 |  | Samuel Burer,
Dieter Vandenbussche:
Solving Lift-and-Project Relaxations of Binary Integer Programs.
SIAM Journal on Optimization 16(3): 726-750 (2006) |
| 2005 |
| 8 |  | Yi Zhang,
W. Nick Street,
Samuel Burer:
Sharing Classifiers among Ensembles from Related Problem Domains.
ICDM 2005: 522-529 |
| 7 |  | Samuel Burer,
Renato D. C. Monteiro:
Local Minima and Convergence in Low-Rank Semidefinite Programming.
Math. Program. 103(3): 427-444 (2005) |
| 2003 |
| 6 |  | Samuel Burer,
Renato D. C. Monteiro:
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization.
Math. Program. 95(2): 329-357 (2003) |
| 5 |  | Samuel Burer,
Renato D. C. Monteiro,
Yin Zhang:
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs.
Math. Program. 95(2): 359-379 (2003) |
| 4 |  | Samuel Burer:
Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices.
SIAM Journal on Optimization 14(1): 139-172 (2003) |
| 2002 |
| 3 |  | Samuel Burer,
Renato D. C. Monteiro,
Yin Zhang:
Solving a class of semidefinite programs via nonlinear programming.
Math. Program. 93(1): 97-122 (2002) |
| 2 |  | Samuel Burer,
Renato D. C. Monteiro,
Yin Zhang:
Maximum stable set formulations and heuristics based on continuous optimization.
Math. Program. 94(1): 137-166 (2002) |
| 1 |  | Samuel Burer,
Renato D. C. Monteiro,
Yin Zhang:
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs.
SIAM Journal on Optimization 12(2): 503-521 (2002) |