Pages that link to "Item:Q2251137"
From MaRDI portal
The following pages link to A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137):
Displaying 11 items.
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- Convex quadratic mixed-integer problems with quadratic constraints (Q2050251) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming (Q2817838) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
