The following pages link to Dieter Vandenbussche (Q839488):
Displaying 8 items.
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau (Q2884566) (← links)
- Solving Lift-and-Project Relaxations of Binary Integer Programs (Q5470217) (← links)
