# Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

@article{Martinovic2018CombinatorialIO,
title={Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case},
author={John Martinovic and Guntram Scheithauer},
journal={Annals of Operations Research},
year={2018},
volume={271},
pages={811-829}
}
We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: find the maximum number of objects, each having a length of at least L, that can be constructed by connecting a given supply of $$m \in \mathbb {N}$$m∈N smaller item lengths $$l_1,\ldots ,l_m$$l1,…,lm with availabilities $$b_1,\ldots , b_m$$b1,…,bm. For this $$\mathcal {NP}$$NP-hard discrete optimization problem, the (additive integrality) gap, i.e., the difference between the… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

## Integer linear programming models for the skiving stock problem

• European Journal of Operational Research
• 2016
VIEW 4 EXCERPTS

## The skiving stock problem as a counterpart of the cutting stock problem

VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

## Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry

• SIAM Review
• 1997
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

VIEW 1 EXCERPT

## An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case

• Discrete Applied Mathematics
• 2017
VIEW 3 EXCERPTS

## Integer rounding and modified integer rounding for the skiving stock problem

• Discrete Optimization
• 2016
VIEW 2 EXCERPTS

VIEW 1 EXCERPT

## The proper relaxation and the proper gap of the skiving stock problem

• Math. Meth. of OR
• 2016
VIEW 3 EXCERPTS

## A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital

• European Journal of Operational Research
• 2013
VIEW 1 EXCERPT

## Spectrum Assignment in Cognitive Radio Networks: A Comprehensive Survey

• IEEE Communications Surveys & Tutorials
• 2013
VIEW 1 EXCERPT