The following pages link to Amélie Lambert (Q304239):
Displayed 13 items.
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Linear Reformulations of Integer Quadratic Programs (Q3627671) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- Valid inequalities and global solution algorithm for Quadratically Constrained Quadratic Programs (Q6340140) (← links)
- A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem (Q6366638) (← links)