A new linearization technique for multi-quadratic 0–1 programming problems
Authors:
- Wanpracha ChaovalitwongseWCWanpracha Chaovalitwongse
- Panos M PardalosPPPanos M Pardalos
- Oleg A ProkopyevOPOleg A Prokopyev
- 1 November 2004
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 32 (6) , 517-522
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Seizure warning algorithm based on optimization and nonlinear dynamicsMathematical Programming, 2004
- Complexity of uniqueness and local search in quadratic 0–1 programmingOperations Research Letters, 1992
- 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
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming ProblemsOperations Research, 1990
- Methods of Nonlinear 0-1 Programming1979
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramOperations Research, 1974
- Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming ProblemsOperations Research, 1967