Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Cutting stock problem"”.
-
An approach to the two dimensional irregular cutting stock problem.
Massachusetts Institute of Technology. Alfred P. Sloan School of Management. Thesis. 1966. B.S.
-
Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem
The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for …
-
Heuristics for the Cutting Stock with Setup Cost and Blood Collection Problems
… up with better decisions for a wide range of problems in different industries. During last decades, Operations Research solution methods have been attained a huge interest in production planning, supply chain management, health care and many other research areas. In this dissertation, two …
-
Integer cutting stock procedures
… methods for solving the one-dimensional. integer cutting stock problem and to synthesize a general integer cutting stock model for paper industry applications. Of the several integer programming and discrete alternative approaches that existed, the combinatorial programming procedure of Pierce was …
-
Problems, Models and Algorithms in One- and Two-Dimensional Cutting
… Mathematics and Operations Research, problems of cutting and packing (C&P) of concrete and abstract objects appear under various specifications (cutting problems, knapsack problems, container and vehicle loading problems, pallet loading, bin packing, assembly line balancing, …
-
An analytics-based decomposition approach to large-scale bilevel optimisation
Bilevel optimisation problems contain several decision makers, each with different objectives and constraints, arranged in a hierarchical structure. One type of bilevel problem is the single-leader, multiple-follower problem, which has been used in applications like toll-setting, resource …