38 research outputs found

    Mini Max Wallpaper

    Get PDF
    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

    Viability and an Olech Type Result

    Get PDF
    [Krastanov M. I.; Кръстанов М. И.]; [Ribarska N. K.; Рибарска Н. К.]2010 Mathematics Subject Classification: 34A36, 34A60
    corecore