Pages that link to "Item:Q1273053"
From MaRDI portal
The following pages link to A polyhedral approach for nonconvex quadratic programming problems with box constraints (Q1273053):
Displaying 31 items.
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Solutions and optimality criteria to box constrained nonconvex minimization problems (Q2469802) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program (Q3105771) (← links)
- (Q4323607) (← links)
- Box Constrained Quadratic Programming with Proportioning and Projections (Q4377570) (← links)
- (Q4795625) (← links)
- AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS (Q4900102) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- (Q5158522) (← links)
- Box-inequalities for quadratic assignment polytopes (Q5955568) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
