Search this article in Google Scholar


分類 国際会議
著者名 (author) Satoshi Fujita,Takeshi Hada
英文著者名 (author)
編者名 (editor)
編者名 (英文)
キー (key)
表題 (title) Two-Dimensional On-Line Bin Packing Problem with Rotatable Items
表題 (英文)
書籍・会議録表題 (booktitle) Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, LNCS
書籍・会議録表題(英文)
巻数 (volume) 1858
号数 (number)
ページ範囲 (pages) 210-220
組織名 (organization)
出版元 (publisher)
出版元 (英文)
出版社住所 (address)
刊行月 (month) July
出版年 (year) 2000
付加情報 (note) Sydney
注釈 (annote) Acceptance rate: 44/81 = 54%, http://www.springerlink.com/content/qp1rquhxwtem69ec/
内容梗概 (abstract) In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 degrees. An on-line algorithm that uses an unbounded number of active bins is proposed. The worst case ratio of the algorithm is at least 2.25 and at most 2.565.
論文電子ファイル Not available.


[1-85]  Satoshi Fujita and Takeshi Hada, ``Two-Dimensional On-Line Bin Packing Problem with Rotatable Items,'' In Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, LNCS, vol. 1858, pp. 210-220, July 2000. (Sydney)

@inproceedings{1_85,
    author = {Satoshi Fujita and Takeshi Hada},
    author_e = {},
    editor = {},
    editor_e = {},
    title = {Two-Dimensional On-Line Bin Packing Problem with Rotatable Items},
    title_e = {},
    booktitle = {Computing and Combinatorics, 6th Annual International
    Conference, COCOON 2000, LNCS},
    booktitle_e = {},
    volume = {1858},
    number = {},
    pages = {210-220},
    organization = {},
    publisher = {},
    publisher_e = {},
    address = {},
    month = {July},
    year = {2000},
    note = {Sydney},
    annote = {Acceptance rate: 44/81 = 54%, http://www.springerlink.com/content/
    qp1rquhxwtem69ec/}
}

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.