# 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} }

- Published in Annals OR 2018
DOI:10.1007/s10479-018-2762-x

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

## 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

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL