We review the most important mathematical models and algorithms developed for the exact
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …

Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …

This article presents a prediction model of the optimal dual variables for the cutting stock
problem. For this purpose, we first analyze the influence of different attributes on the optimal …

Lot sizing and cutting stock problems generally arise in manufacturing as a two stage
connected process. Although these two problems have been addressed separately by many …

In transportation of goods in large container ships, shipping industries need to minimize the
time spent at ports to load/unload containers. An optimal stowage of containers on board …

We investigate the scheduling practices of a medical school that must assign a cohort of
students to a series of clinical rotations, while respecting both operational and quality‐of …

Pipes have been using for different construction purposes, such as tube wells, oil wells, gas
wells, and other sanitary purposes. These pipes have different sizes that can be used …

The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting
large objects in order to produce small items. The computational effort for solving this …

Packing problems (sometimes also called cutting problems) are combinatorial optimization
problems concerned with placement of objects (items) in one or several containers. Some …

We are given a set of objects, each characterized by a weight and a fragility, and a large
number of uncapacitated bins. Our aim is to find the minimum number of bins needed to …