Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen

DOI10.1007/BF01459079MaRDI QIDQ1168893zbMATH OpenOpenAlexFDO

Authors 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

branch-and-bounddual problemLagrange dualitypositive semi-definite matrixquadratic boolean optimizationsubgradient method

Mathematics Subject Classification ID

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

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
• scientific article; zbMATH DE number 3296914 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)

Cited in

(8)

• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Valid inequalities for quadratic optimisation with domain constraints
• Method of obtaining estimates in quadratic extremal problems with Boolean variables
• 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
• An exact penalty approach for solving a class of minimization problems with boolean variables
• On duality for Boolean programming
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168893)