Pages that link to "Item:Q1774170"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170):
Displaying 15 items.
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
- (Q4980087) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- (Q5158522) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)