Remarks on a difficult test problem for quadratic boolean programming

DOI10.1080/02331939208843863zbMath0815.65082OpenAlexW2067046688MaRDI QIDQ4327980

P. Frank Körner

Publication date: 30 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

quadratic 0-1 programmingbranch-and-bound test problems

Mathematics Subject Classification ID

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

Related Items (2)

A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ Semidefinite programming for discrete optimization and matrix completion problems

This page was built for publication: Remarks on a difficult test problem for quadratic boolean programming