Complexity of uniqueness and local search in quadratic 0–1 programming
- 1 March 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 11 (2), 119-123
- https://doi.org/10.1016/0167-6377(92)90043-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Construction of test problems in quadratic bivalent programmingACM Transactions on Mathematical Software, 1991
- Graph separation techniques for quadratic zero-one programmingComputers & Mathematics with Applications, 1991
- Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architectureAnnals of Operations Research, 1990
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- Recognition problems for special classes of polynomials in 0–1 variablesMathematical Programming, 1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- Checking local optimality in constrained quadratic programming is NP-hardOperations Research Letters, 1988
- Methods of Nonlinear 0-1 ProgrammingAnnals of Discrete Mathematics, 1979