Dieter Vandenbussche, Ph.D.

Affiliations: 
2003 Georgia Institute of Technology, Atlanta, GA 
Area:
Operations Research, Industrial Engineering, Mathematics
Google:
"Dieter Vandenbussche"

Parents

Sign in to add mentor
George L. Nemhauser grad student 2003 Georgia Tech
 (Polyhedral approaches to solving nonconvex quadratic programs.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Stubbs RA, Vandenbussche D. (2010) Constraint attribution Journal of Portfolio Management. 36: 48-59
Burer S, Vandenbussche D. (2009) Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound Computational Optimization and Applications. 43: 181-195
Campbell AM, Vandenbussche D, Hermann W. (2008) Routing for relief efforts Transportation Science. 42: 127-145
Lin TC, Vandenbussche D. (2008) Box-constrained quadratic programs with fixed charge variables Journal of Global Optimization. 41: 75-102
Burer S, Vandenbussche D. (2008) A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations Mathematical Programming. 113: 259-282
Burer S, Vandenbussche D. (2006) Solving lift-and-project relaxations of binary integer programs Siam Journal On Optimization. 16: 726-750
Vandenbussche D, Nemhauser GL. (2005) The 2-edge-connected subgraph polyhedron Journal of Combinatorial Optimization. 9: 357-379
Vandenbussche D, Nemhauser GL. (2005) A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Mathematical Programming. 102: 559-575
Vandenbussche D, Nemhauser GL. (2005) A polyhedral study of nonconvex quadratic programs with box constraints Mathematical Programming. 102: 531-557
Cornuéjols G, Li Y, Vandenbussche D. (2003) K-cuts: A variation of Gomory mixed integer cuts from the LP tableau Informs Journal On Computing. 15: 385-396
See more...