Lexicographic Branch-and-Bound Column Search

We present an exact generic method for solving the pricing subproblem in a column generation approach, which we call branch-and-bound column search. It searches the space of all feasible columns via a branch-and-bound tree search and simultaneously returns all columns with a reduced-cost value below a certain threshold. The approach is based on an idea … Read more

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

The One-Dimensional Cutting Stock Problem with Setup Cost (CSP-S) is a cutting problem that seeks a cutting plan with a minimum number of objects and a minimum number of different patterns. This problem gains relevance in manufacturing settings, where time consuming operations to set up the knives of the cutting machine for the new patterns … Read more