z-logo
open-access-imgOpen Access
An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given
Author(s) -
D.O. Lazarev,
N.N. Kuzyurin
Publication year - 2019
Publication title -
trudy instituta sistemnogo programmirovaniâ ran/trudy instituta sistemnogo programmirovaniâ
Language(s) - English
Resource type - Journals
eISSN - 2220-6426
pISSN - 2079-8156
DOI - 10.15514/ispras-2019-31(1)-9
Subject(s) - rectangle , probabilistic logic , hash function , bin packing problem , algorithm , probabilistic analysis of algorithms , packing problems , strips , upper and lower bounds , mathematics , enumeration , combinatorics , computer science , statistics , geometry , mathematical analysis , computer security , bin

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here