Persistency in quadratic 0-1 optimization
From MaRDI portal
Publication:1190604
DOI10.1007/BF01586044zbMath0771.90070MaRDI QIDQ1190604
Alain Sutter, Alain Billionnet
Publication date: 26 September 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
linear time algorithmquadratic pseudo-Boolean functionbest rooflowest upper linear boundpersistency properties
Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
Minimization of a quadratic pseudo-Boolean function ⋮ Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ Pseudo-Boolean optimization ⋮ Generalized roof duality ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Cites Work
This page was built for publication: Persistency in quadratic 0-1 optimization
