Persistency in quadratic 0-1 optimization
DOI10.1007/BF01586044zbMATH Open0771.90070MaRDI QIDQ1190604FDOQ1190604
Authors: Alain Billionnet, Alain Sutter 
Publication date: 26 September 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
linear time algorithmquadratic pseudo-Boolean functionbest rooflowest upper linear boundpersistency properties
Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)
Cites Work
Cited In (13)
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Roof duality for polynomial 0–1 optimization
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- A linearization framework for unconstrained quadratic (0-1) problems
- Pseudo-Boolean optimization
- Neighborhood persistency of the linear optimization relaxation of integer linear optimization
- Minimization of a quadratic pseudo-Boolean function
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Title not available (Why is that?)
- Persistency in 0-1 polynomial programming
- Generalized roof duality
This page was built for publication: Persistency in quadratic 0-1 optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190604)
