A new linearization technique for multi-quadratic 0-1 programming problems

Authors:
Wanpracha Chaovalitwongse;Panos M Pardalos;Oleg A Prokopyev
Affiliations:
Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL 32611, USA;Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL 32611, USA;Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
2004

Citing 6
Cited 8

Linearization strategies for a class of zero-one mixed integer programming problems

Operations Research
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture

Annals of Operations Research
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)
Seizure warning algorithm based on optimization and nonlinear dynamics

Mathematical Programming: Series A and B
Complexity of uniqueness and local search in quadratic 0-1 programming

Operations Research Letters

On the time series support vector machine using dynamic time warping kernel for brain activity classification

Cybernetics and Systems Analysis
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

Discrete Applied Mathematics
A review of recent advances in global optimization

Journal of Global Optimization
Optimization of spatiotemporal clustering for target tracking from multisensor data

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Linear and quadratic programming approaches for the general graph partitioning problem

Journal of Global Optimization
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

Journal of Global Optimization
On zero duality gap in nonconvex quadratic programming problems

Journal of Global Optimization
Linear forms of nonlinear expressions: New insights on old ideas

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variables remains the same.