NEW THEORETICAL INVESTIGATIONS ON THE GAP OF THE SKIVING STOCK PROBLEM

ABSTRACT The one-dimensional skiving stock problem is a combinatorial optimization problem being of high relevance whenever an efficient and sustainable utilization of given resources is intended. In the classical formulation, a given supply of (small) item lengths has to be used to build as many large objects (specified by some target length) as possible. For this ����-hard (discrete) optimization problem, we investigate the quality of the continuous relaxation by considering the additive integrality gap, i.e., the difference between the optimal values of the integer problem and its L...