Because of the sharp development of (commercial) MILP software and hardware components, pseudo-polynomial formulations have been established as a viable tool for solving cutting and packing problems in recent years. Constituting a natural (but independent) counterpart of the well-known cutting stock problem, the one-dimensional skiving stock problem (SSP) asks for the maximal number of large objects (specified by some threshold length) that can be obtained by recomposing a given inventory of smaller items. In this paper, we introduce a new arcflow formulation for the SSP applying the idea of reflected arcs. In particular, this new model is shown to possess significantly fewer variables as well as a better numerical performance compared to the standard arcflow formulation.

An Improved Arcflow Model for the Skiving Stock Problem / Martinovic, John; Delorme, Maxence; Iori, Manuel; Scheithauer, Guntram. - (2019), pp. 135-141. ((Intervento presentato al convegno Annual International Conference of the German Operations Research Society (GOR) tenutosi a Brussels, Belgium nel September 12-14, 2018.

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Powered by IRIS-about IRIS-Utilizzo dei cookie

 Copyright © 2021