Pages that link to "Item:Q662304"

The following pages link to Extending the QCR method to general mixed-integer programs (Q662304):

Displaying 32 items.

• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
• An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
• The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems (Q2162511) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
• Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
• A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
• A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
• Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
• Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
• Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
• Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs (Q5108255) (← links)