Group for Research in Decision Analysis

Multi-quadratic 01 programming

Panos M. Pardalos

This presentation will focus on unconstrained and constrained quadratic 01 programming problems and their equivalent formulations. Based on these formulations we describe several linearization techniques, which allow us to solve quadratic and multi-quadratic 01 programming problems by applying any commercial package used for solving linear mixed integer programming problems. We also discuss branch-and-bound algorithms for unconstrained quadratic 0-1 programming problems, complexity issues, and applications.