Lower bound improvement and forcing rule for quadratic binary programming

DOI10.1007/S10589-005-3062-3zbMath1111.90081OpenAlexW1997388944MaRDI QIDQ2506180

Hong-Xuan Huang, Panos M. Pardalos, Oleg A. Prokopyev

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3062-3

zbMATH Keywords

lower boundbranch and bound algorithmquadratic binary programmingforcing rule

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Experiments in quadratic 0-1 programming
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Ellipsoidal approach to box-constrained quadratic problems
• Approximating quadratic programming with bound and quadratic constraints
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Methods of Nonlinear 0-1 Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Quadratic knapsack problems
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Construction of test problems in quadratic bivalent programming
• Convex Analysis
• Introduction to global optimization.
• Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures

Related Items (16)

On characterization of maximal independent sets via quadratic optimization ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ On duality gap in binary quadratic programming ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ The spherical constraint in Boolean quadratic programs ⋮ Box-constrained quadratic programs with fixed charge variables ⋮ Stability of semilinear elliptic optimal control problems with pointwise state constraints ⋮ Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ The equitable dispersion problem ⋮ On linear conic relaxation of discrete quadratic programs

This page was built for publication: Lower bound improvement and forcing rule for quadratic binary programming