eprintid: 632
rev_number: 14
eprint_status: archive
userid: 12
dir: disk0/00/00/06/32
datestamp: 2013-12-04 23:22:53
lastmod: 2015-05-29 20:15:21
status_changed: 2013-12-04 23:22:53
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Marigonda, A.
creators_name: Aleksov, D.
creators_name: Idziak, J.
creators_name: Georgiev, K.
creators_name: Kozlowski, M.
creators_name: Krastanov, M.
creators_name: Veneva, M.
creators_name: Sikora, M.
creators_name: Angelov, S.
title: Mini Max Wallpaper
ispublished: pub
subjects: retail
subjects: other
subjects: decision
studygroups: esgi95
companyname: Mini Max
full_text_status: public
abstract: 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.
date: 2013
citation:   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]     
document_url: http://miis.maths.ox.ac.uk/miis/632/1/p4_mini-max.pdf