Minimization of a quadratic pseudo-Boolean function
- 13 October 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 78 (1) , 106-115
- https://doi.org/10.1016/0377-2217(94)90125-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Persistency in quadratic 0–1 optimizationMathematical Programming, 1992
- Algorithms for the maximum satisfiability problemComputing, 1990
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic FunctionsMathematics of Operations Research, 1987
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960