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