Dieter Vandenbussche

According to our database1, Dieter Vandenbussche authored at least 9 papers between 2003 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound.
Comput. Optim. Appl., 2009

2008
Routing for Relief Efforts.
Transp. Sci., 2008

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.
Math. Program., 2008

Box-constrained quadratic programs with fixed charge variables.
J. Glob. Optim., 2008

2006
Solving Lift-and-Project Relaxations of Binary Integer Programs.
SIAM J. Optim., 2006

2005
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.
Math. Program., 2005

A polyhedral study of nonconvex quadratic programs with box constraints.
Math. Program., 2005

The 2-Edge-Connected Subgraph Polyhedron.
J. Comb. Optim., 2005

2003
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau.
INFORMS J. Comput., 2003


  Loading...