✦ 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
DOI: 10.1016/j.mcm.2011.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constrained two-dimensional cutting stoc

Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

✍ Van-Dat Cung; Mhand Hifi; Bertrand Le Cun 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 448 KB

Heuristic and exact algorithms for gener

Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns

✍ Yaodong Cui 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A recursive branch and bound algorithm f

A recursive branch and bound algorithm for the multidimensional knapsack problem

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

A branch-and-bound algorithm for the sin

A branch-and-bound algorithm for the singly constrained assignment problem

✍ P.M.D. Lieshout; A. Volgenant 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A branch-and-bound algorithm for the res

A branch-and-bound algorithm for the resource-constrained project scheduling problem

✍ U. Dorndorf; E. Pesch; T. Phan-Huy 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 184 KB

A branch and cut algorithm for nonconvex

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

✍ 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