<  Back to the Polytechnique Montréal portal

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

Christoph Buchheim, Alberto Caprara and Andrea Lodi

Paper (2010)

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/18552/
Conference Title: 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010)
Conference Location: Lausanne, Suisse
Conference Date(s): 2010-06-09 - 2010-06-11
Publisher: Springer
DOI: 10.1007/978-3-642-13036-6_22
Official URL: https://doi.org/10.1007/978-3-642-13036-6_22
Date Deposited: 18 Apr 2023 15:13
Last Modified: 25 Sep 2024 15:56
Cite in APA 7: Buchheim, C., Caprara, A., & Lodi, A. (2010, June). An effective branch-and-bound algorithm for convex quadratic integer programming [Paper]. 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Suisse. https://doi.org/10.1007/978-3-642-13036-6_22

Statistics

Dimensions

Repository Staff Only

View Item View Item