The MIIS Eprints Archive

Mini Max Wallpaper

Marigonda, A. and Aleksov, D. and Idziak, J. and Georgiev, K. and Kozlowski, M. and Krastanov, M. and Veneva, M. and Sikora, M. and Angelov, S. (2013) Mini Max Wallpaper. [Study Group Report]



Mini Max company formulated a problem for the automatic calculation of the number of wallpaper rolls necessary for decorating a room with wallpaper. The final goal is the development of a web-based calculator open for use to both Mini Max staff and the general public. We propose an approach for reducing the studied problem to the one-dimensional cutting-stock problem. We show this in details for the case of plain wallpapers as well as for the case of patterned wallpapers with straight match. The one-dimensional cutting-stock problem can be formulated as a linear integer programming problem. We develop an approach for calculating the needed number of wallpapers for relatively small problems, create an algorithm in a suitable graphical interface and make different tests. The tests show the efficiency of the proposed approach compared with the existent (available) wallpapers’ calculators.

Item Type:Study Group Report
Problem Sectors:Retail
Decision making
Study Groups:European Study Group with Industry > ESGI 95 (Sofia, Bugaria, Sept 23-27, 2013)
Company Name:Mini Max
ID Code:632
Deposited By: Matthew Hennessy
Deposited On:04 Dec 2013 23:22
Last Modified:29 May 2015 20:15

Repository Staff Only: item control page