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 …

In the last decade, decision diagrams (DDs) have been the basis for a large array of novel
approaches for modeling and solving optimization problems. Many techniques now use DDs …

Emergency department overcrowding is a global issue that poses a great threat to patient
health and safety. The timeliness of medical services provided to patients is crucial to …

The parallel processor scheduling and bin packing problems with contiguity constraints are
important in the field of combinatorial optimization because both problems can be used as …

We consider two neighboring generalizations of the classical bin packing problem: the
temporal bin packing problem (TBPP) and the temporal bin packing problem with fire-ups …

We address the problem of scheduling jobs with non-identical sizes and distinct processing
times on a single batch-processing machine, aiming at minimizing the makespan. The …

We address the solution of Mixed Integer Linear Programming (MILP) models with strong
relaxations that are derived from Dantzig–Wolfe decompositions and allow a pseudo …

The steady growth in e-commerce and grocery deliveries within cities strains the available
infrastructure in urban areas by increasing freight movements, aggravating traffic …

Industrial manufacturing is often organized in assembly lines where a product is assembled
on a sequence of stations, each of which executes some of the assembly tasks. A line is …

This paper addresses the one-dimensional cutting stock problem, focusing on minimizing
total stock usage. Most procedures that deal with this problem reside on linear programming …