scientific article; zbMATH DE number 221928
From MaRDI portal
Publication:4697332
DOI<373::AID-NAV3220400307>3.0.CO;2-A 10.1002/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-AzbMath0782.90071MaRDI QIDQ4697332
Michèle Ruiz, Junjie Xiong, Pierre Hansen, Brigitte Jaumard
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, A computational study on QP problems with general linear constraints, Domain reduction techniques for global NLP and MINLP optimization, An LPCC approach to nonconvex quadratic programs, Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Box-constrained quadratic programs with fixed charge variables, A computational comparison of some branch and bound methods for indefinite quadratic programs, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, A polyhedral study of nonconvex quadratic programs with box constraints, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Solutions to quadratic minimization problems with box and integer constraints, A new algorithm for the general quadratic programming problems with box constraints, Quadratic optimization over a polyhedral cone, A binarisation heuristic for non-convex quadratic programming with box constraints, New optimality conditions for quadratic optimization problems with binary constraints, Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality, Compact mixed-integer programming formulations in quadratic optimization
Cites Work
