New bounds on the unconstrained quadratic integer programming problem
From MaRDI portal
Publication:925231
DOI10.1007/S10898-007-9155-ZzbMATH Open1146.90041OpenAlexW2151954274MaRDI QIDQ925231FDOQ925231
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9155-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook of test problems in local and global optimization
- Laplacian eigenvalues and the maximum cut problem
- Reverse search for enumeration
- Convex Relaxations of (0, 1)-Quadratic Programming
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- 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
- A polynomial case of unconstrained zero-one quadratic optimization
- Partition of Space
- The vector partition problem for convex objective functions.
Cited In (9)
- 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 polynomial case of convex integer quadratic programming problems with box integer constraints
- Global optimality conditions and optimization methods for quadratic integer programming 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
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A new branch and bound algorithm for indefinite integer quadratic programs 👍 👎
- Title not available (Why is that?) 👍 👎
- A new bound for the quadratic assignment problem based on convex quadratic programming 👍 👎
- On boundedness of (quasi-)convex integer optimization problems 👍 👎
- Title not available (Why is that?) 👍 👎
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)
