| |
| 2008 | ||
|---|---|---|
| 5 | EE | Samuel Burer, Dieter Vandenbussche: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2): 259-282 (2008) |
| 2005 | ||
| 4 | EE | Dieter Vandenbussche, George L. Nemhauser: The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005) |
| 3 | EE | Dieter Vandenbussche, George L. Nemhauser: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005) |
| 2 | EE | Dieter Vandenbussche, George L. Nemhauser: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559-575 (2005) |
| 2003 | ||
| 1 | EE | Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche: K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. INFORMS Journal on Computing 15(4): 385-396 (2003) |
| 1 | Samuel Burer | [5] |
| 2 | Gérard Cornuéjols | [1] |
| 3 | Yanjun Li | [1] |
| 4 | George L. Nemhauser | [2] [3] [4] |