K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. - Gérard Cornuéjols; Yanjun Li; Dieter Vandenbussche (INFORMS J. Comput., 2003)

The 2-Edge-Connected Subgraph Polyhedron. - Dieter Vandenbussche; George L. Nemhauser (J. Comb. Optim., 2005)

A polyhedral study of nonconvex quadratic programs with box constraints. - Dieter Vandenbussche; George L. Nemhauser (Math. Program., 2005)

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. - Dieter Vandenbussche; George L. Nemhauser (Math. Program., 2005)

Solving Lift-and-Project Relaxations of Binary Integer Programs. - Samuel Burer; Dieter Vandenbussche (SIAM J. Optim., 2006)

Box-constrained quadratic programs with fixed charge variables. - Tin-Chi Lin; Dieter Vandenbussche (J. Glob. Optim., 2008)

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. - Samuel Burer; Dieter Vandenbussche (Math. Program., 2008)

Routing for Relief Efforts. - Ann Melissa Campbell; Dieter Vandenbussche; William Hermann (Transp. Sci., 2008)

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. - Samuel Burer; Dieter Vandenbussche (Comput. Optim. Appl., 2009)