Dieter Vandenbussche

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2009
j9		Samuel Burer, Dieter Vandenbussche: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comp. Opt. and Appl. 43(2): 181-195 (2009)
	2008
j8		Tin-Chi Lin, Dieter Vandenbussche: Box-constrained quadratic programs with fixed charge variables. J. Global Optimization 41(1): 75-102 (2008)
j7		Samuel Burer, Dieter Vandenbussche: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2): 259-282 (2008)
j6		Ann Melissa Campbell, Dieter Vandenbussche, William Hermann: Routing for Relief Efforts. Transportation Science 42(2): 127-145 (2008)
	2006
j5		Samuel Burer, Dieter Vandenbussche: Solving Lift-and-Project Relaxations of Binary Integer Programs. SIAM Journal on Optimization 16(3): 726-750 (2006)
	2005
j4		Dieter Vandenbussche, George L. Nemhauser: The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005)
j3		Dieter Vandenbussche, George L. Nemhauser: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005)
j2		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
j1		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)

Coauthor Index

Last update Tue May 21 17:47:18 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page