Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme

DOI10.1002/zamm.19850650820zbMath0576.65056OpenAlexW1986836004MaRDI QIDQ3696404

No author found.

Publication date: 1985

Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19850650820

zbMATH Keywords

branch-and-bound algorithmBoolean quadratic optimizationISING-Problem

Mathematics Subject Classification ID

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

Related Items

Models and methods of solution of quadratic integer programming problems, Pseudo-Boolean optimization, On duality for Boolean programming

Cites Work

• Integer programming and related areas. A classified bibliography
• An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds