An effective branch-and-bound algorithm for convex quadratic integer programming

Christoph Buchheim, Alberto Caprara and Andrea Lodi

Article (2012)

Document published while its authors were not affiliated with Polytechnique Montréal

An external link is available for this item

PolyPublie URL:	https://publications.polymtl.ca/15714/
Journal Title:	Mathematical Programming (vol. 135, no. 1-2)
Publisher:	Springer
DOI:	10.1007/s10107-011-0475-x
Official URL:	https://doi.org/10.1007/s10107-011-0475-x
Date Deposited:	18 Apr 2023 15:10
Last Modified:	08 Apr 2025 01:43

Cite in APA 7:	Buchheim, C., Caprara, A., & Lodi, A. (2012). An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming, 135(1-2), 369-395. https://doi.org/10.1007/s10107-011-0475-x
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only