A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1

DOI10.1080/02331938808843386zbMath0658.90066OpenAlexW1993308380MaRDI QIDQ3807879

No author found.

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843386

zbMATH Keywords

dualitybranch and boundSuperlinear convergencetight boundsBoolean quadratic optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09) Duality theory (optimization) (49N15)

Related Items

The Boolean Quadric Polytope ⋮ The Random QUBO ⋮ A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem ⋮ Hidden convexity in some nonconvex quadratically constrained quadratic programming ⋮ Bounds for Random Binary Quadratic Programs ⋮ Best ellipsoidal relaxation to solve a nonconvex problem. ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ On duality for Boolean programming ⋮ Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The indefinite zero-one quadratic problem
• Integer quadratic optimization
• Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
• Methods of Nonlinear 0-1 Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Mixed-integer quadratic programming
• Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme