New bounds on the unconstrained quadratic integer programming problem
From MaRDI portal
Publication:925231
DOI10.1007/S10898-007-9155-ZzbMATH Open1146.90041OpenAlexW2151954274MaRDI QIDQ925231FDOQ925231
Recommendations
- Une borne optimale pour la programmation entière quasi-convexe
- A new branch and bound algorithm for integer quadratic programming problems
- New bounds for nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 3970529
- A new branch and bound method for integer quadratic programming problems
- A new branch and bound algorithm for indefinite integer quadratic programs
- scientific article; zbMATH DE number 826948
- A new bound for the quadratic assignment problem based on convex quadratic programming
- On boundedness of (quasi-)convex integer optimization problems
- An interval algorithm for quadratic programming in unbounded domains
Cites Work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polynomial case of unconstrained zero-one quadratic optimization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convex Relaxations of (0, 1)-Quadratic Programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook of test problems in local and global optimization
- Laplacian eigenvalues and the maximum cut problem
- Maximally Robust Controllers for Multivariable Systems
- On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Partition of Space
- Reverse search for enumeration
- The vector partition problem for convex objective functions.
Cited In (13)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- Maximization of a PSD quadratic form and factorization
- Parametric Lagrangian dual for the binary quadratic programming problem
- A continuous method for computing bounds in integer quadratic optimization problems
- A new algorithm for quadratic integer programming problems with cardinality constraint
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- A note on approximating quadratic programming with rank constraint
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- Une borne optimale pour la programmation entière quasi-convexe
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- A polynomial case of unconstrained zero-one quadratic optimization
This page was built for publication: New bounds on the unconstrained quadratic integer programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925231)
