Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen

DOI10.1007/BF01459079zbMath0493.90059OpenAlexW154818541MaRDI QIDQ1168893

Frank Koerner, Claus-Peter Richter

Publication date: 1982

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132818

zbMATH Keywords

dual problemsubgradient methodbranch-and-boundLagrange dualitypositive semi-definite matrixquadratic boolean optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (8)

A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming ⋮ Method of obtaining estimates in quadratic extremal problems with Boolean variables ⋮ Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem ⋮ A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹ ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ An exact penalty approach for solving a class of minimization problems with boolean variables ⋮ On duality for Boolean programming

Cites Work

• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen