Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Original language	English
Pages (from-to)	120-129
Number of pages	10
Journal	Discrete Applied Mathematics
Volume	187
DOIs	https://doi.org/10.1016/j.dam.2015.02.020
Publication status	Published - 31 May 2015

Cutting stock problem, Bin packing problem, Integer round-up property, Equivalence of instances, Weighted simple games, ROUND-UP PROPERTY, POWER INDEX PROBLEM

ID: 553958