Canonical dual approach to solving 0-1 quadratic programming problems

By S. Fang, David Yang Gao, Ruey-Lin Sheu, Soon-Yi Wu. 2008

81 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/c376d08b3d58d3f71d56c8db8d4abfd21ced78e9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Chrysanthos E. Gounaris
2. Christodoulos A. Floudas
3. John L. Klepeis

In Control and Systems Engineering

1. Christodoulos A. Floudas
2. Chrysanthos E. Gounaris
3. Ruth Misener

In Numerical Analysis

1. Christodoulos A. Floudas
2. Chrysanthos E. Gounaris
3. Ruth Misener

Citations in the corpus

• A review of recent advances in global optimization (2009, background): “Based on the canonical dual transformation (Gao 2004), Fang et al. (2008) constructed a pair of canonical dual problems for the 0–1 quadratic programming problem, showed that no duality gap exists, derived optimality conditions of both the local and global type, and developed an algorithm for large…”