?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F632%2F&rft.title=Mini+Max+Wallpaper&rft.creator=Marigonda%2C+A.&rft.creator=Aleksov%2C+D.&rft.creator=Idziak%2C+J.&rft.creator=Georgiev%2C+K.&rft.creator=Kozlowski%2C+M.&rft.creator=Krastanov%2C+M.&rft.creator=Veneva%2C+M.&rft.creator=Sikora%2C+M.&rft.creator=Angelov%2C+S.&rft.subject=Retail&rft.subject=None%2FOther&rft.subject=Decision+making&rft.description=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%2C+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%E2%80%99+calculators.&rft.date=2013&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F632%2F1%2Fp4_mini-max.pdf&rft.identifier=++Marigonda%2C+A.+and+Aleksov%2C+D.+and+Idziak%2C+J.+and+Georgiev%2C+K.+and+Kozlowski%2C+M.+and+Krastanov%2C+M.+and+Veneva%2C+M.+and+Sikora%2C+M.+and+Angelov%2C+S.++(2013)+Mini+Max+Wallpaper.++%5BStudy+Group+Report%5D+++++