✦ LIBER ✦

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

✍ Scribed by Christoph Buchheim, Alberto Caprara, Andrea Lodi

Book ID: 118791897
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 488 KB
Volume: 135
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-011-0475-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient branch and bound algorithm

An efficient branch and bound algorithm to solve the quadratic integer programming problem

✍ F. Körner 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 333 KB

An implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

An algorithm for indefinite integer quad

An algorithm for indefinite integer quadratic programming

✍ S.S. Erenguc; H.P. Benson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b

An improved branch and bound algorithm f

An improved branch and bound algorithm for mixed integer nonlinear programs

✍ Brian Borchers; John E. Mitchell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 870 KB

The reduced cost branch and bound algori

The reduced cost branch and bound algorithm for mixed integer programming

✍ R.Kipp Martin; Dennis J. Sweeney; Michael E. Doherty 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 860 KB

An Outcome Space Branch and Bound-Outer

An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming

✍ Harold P. Benson 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 164 KB