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

D. Li (), X. Sun () and C. Liu ()

Journal of Global Optimization, 2012, vol. 52, issue 4, pages 797-829

Keywords: Quadratic 0–1 programming; Nonlinear integer programming; Optimality condition; Lower bounds; Variable fixation; Branch-and-bound method (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations Track citations by RSS feed

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-011-9713-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:spr:jglopt:v:52:y:2012:i:4:p:797-829

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

Access Statistics for this article

Journal of Global Optimization is edited by Panos M. Pardalos

More articles in Journal of Global Optimization from Springer
Series data maintained by Guenther Eichhorn ().