The MILP Road to MIQCP
From MaRDI portal
Publication:2897304
DOI10.1007/978-1-4614-1927-3_13zbMath1242.90122OpenAlexW158695287MaRDI QIDQ2897304
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_13
Related Items
Linear transformation based solution methods for non-convex mixed integer quadratic programs, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Optimal mapping of cloud virtual machines, On convex relaxations for quadratically constrained quadratic programming, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Ellipsoid Bounds for Convex Quadratic Integer Programming, Two-term disjunctions on the second-order cone, Representing quadratically constrained quadratic programs as generalized copositive programs, On global optimization with indefinite quadratics, A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines, Valid inequalities for quadratic optimisation with domain constraints, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Relaxations and discretizations for the pooling problem, How to convexify the intersection of a second order cone and a nonconvex quadratic, Mixed integer programming with a class of nonlinear convex constraints, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, A note on convex reformulation schemes for mixed integer quadratic programs, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, An integer linear programming approach for a class of bilinear integer programs, QPLIB: a library of quadratic programming instances, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Compact mixed-integer programming formulations in quadratic optimization
