𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic programming algorithms for the optimal cutting of equal rectangles

✍ Scribed by Yaodong Cui

Book ID
108056807
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
200 KB
Volume
29
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-reduce-cut algorithm for the gl
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
✍ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal πŸ“‚ Article πŸ“… 2006 πŸ› Springer-Verlag 🌐 English βš– 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non