DOAJ Open Access 2019

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

Denis Olegovitch Lazarev Nikolay Nikolaevitch Kuzyurin

Abstrak

In this article, an analog of previously proposed algorithm Limited Hash Packing for Multiple Strip Packing Problem is studied using probabilistic analysis. Limited Hash Packing is an on-line algorithm, which works in closed-end mode, knowing the number of rectangles it has to pack before knowing the heights and width of the first rectangle.

Topik & Kata Kunci

Electronic computers. Computer science

Penulis (2)

Denis Olegovitch Lazarev

Nikolay Nikolaevitch Kuzyurin

Format Sitasi

APA MLA BibTeX

Lazarev, D.O., Kuzyurin, N.N. (2019). 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. https://doi.org/10.15514/ISPRAS-2019-31(1)-9

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.15514/ISPRAS-2019-31(1)-9

Informasi Jurnal

Tahun Terbit: 2019
Sumber Database: DOAJ
DOI: 10.15514/ISPRAS-2019-31(1)-9
Akses: Open Access ✓