# An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach

@article{Li2012AnES, title={An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach}, author={Duan Li and Xiao Wei Sun and Chunli Liu}, journal={Journal of Global Optimization}, year={2012}, volume={52}, pages={797-829} }

- Published in J. Global Optimization 2012
DOI:10.1007/s10898-011-9713-2

We explore in this paper certain rich geometric properties hidden behind quadratic 0–1 programming. Especially, we derive new lower bounding methods and variable fixation techniques for quadratic 0–1 optimization problems by investigating geometric features of the ellipse contour of a (perturbed) convex quadratic function. These findings further lead to some new optimality conditions for quadratic 0–1 programming. Integrating these novel solution schemes into a proposed solution algorithm of a… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Hybrid Exact Methods for Solving Strictly Convex Integer Quadratic Programs

VIEW 5 EXCERPTS

CITES METHODS, BACKGROUND & RESULTS

HIGHLY INFLUENCED

## Quadratic Convex Reformulations for Semicontinuous Quadratic Programming

VIEW 1 EXCERPT

CITES BACKGROUND

## Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems

VIEW 3 EXCERPTS

CITES METHODS & BACKGROUND

## The unconstrained binary quadratic programming problem: a survey

VIEW 2 EXCERPTS

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 50 REFERENCES

## Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Computational aspects of a branch and bound algorithm for quadratic zero-one programming

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## The indefinite zero-one quadratic problem

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Note on converting the 0–1 polynomial programming problem into a 0–1 linear program

VIEW 1 EXCERPT

## Boolean methods in operations research and related areas

VIEW 1 EXCERPT