A computational study on QP problems with general linear constraints
From MaRDI portal
(Redirected from Publication:2673522)
Recommendations
- Computational study of a family of mixed-integer quadratic programming problems
- Computational study of a family of mixed-integer quadratic programming problems
- A computational study on the quadratic knapsack problem with multiple constraints
- Methods for convex and general quadratic programming
- scientific article; zbMATH DE number 1057696
Cites work
- A new branch-and-bound algorithm for standard quadratic programming problems
- BARON: A general purpose global optimization software package
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization problems and domain reduction strategies
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 3431982 (Why is no real title available?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- QPLIB: a library of quadratic programming instances
- Quadratic programming with one negative eigenvalue is NP-hard
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Theoretical and computational results about optimality-based domain reductions
- Three enhancements for optimization-based bound tightening
Cited in
(4)- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- scientific article; zbMATH DE number 1223553 (Why is no real title available?)
- Globally solving concave quadratic programs via doubly nonnegative relaxation
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
This page was built for publication: A computational study on QP problems with general linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673522)
