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}
}
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
BETA

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 50 REFERENCES

EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING

F B A R A H O N A, M J U N G, G R E I N
  • 2005
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The indefinite zero-one quadratic problem

  • Discrete Applied Mathematics
  • 1984
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

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

F. Glover, R.E.D. Woolsey
  • Oper. Res. 22, 180–181 (1974) 123 J Glob Optim
  • 2012
VIEW 1 EXCERPT