๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A recursive branch-and-bound algorithm for constrained homogenous T-shape cutting patterns

โœ Scribed by Yaodong Cui; Yuli Yang


Book ID
108201025
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
628 KB
Volume
54
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A branch and cut algorithm for nonconvex
โœ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 221 KB

We present a branch and cut algorithm that yields in finite time, a globally โ˜ผ-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra