Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
Sign Up to like & getrecommendations! Published in 2018 at "Optimization"
DOI: 10.1080/02331934.2018.1494171
Abstract: ABSTRACT We consider the one-dimensional skiving stock problem which is strongly related to the dual bin packing problem: given a supply of (small) items, the aim is to construct as many large items (specified by… read more here.
Keywords: polyhedral theory; means polyhedral; stock problem; skiving stock ... See more keywords