WEKO3
アイテム
Anti-Slide
https://ipsj.ixsq.nii.ac.jp/records/142064
https://ipsj.ixsq.nii.ac.jp/records/142064bb6dcffa-1d3a-4364-99bb-ca6cd314d686
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5605004 (1.2 MB)
|
Copyright (c) 2015 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2015-05-15 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Anti-Slide | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | Anti-Slide | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | [特集：娯楽の離散数理] anti-slide packing, integer programming, IP solver, puzzle | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 著者所属 | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者所属 | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者所属 | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of Computer Science, Gunma University | ||||||||||||
| 著者名 |
Kazuyuki, Amano
× Kazuyuki, Amano
× Shin-ichi, Nakano
× Koichi, Yamazaki
|
|||||||||||
| 著者名(英) |
Kazuyuki, Amano
× Kazuyuki, Amano
× Shin-ichi, Nakano
× Koichi, Yamazaki
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | The anti-slide packing is a packing of a number of three dimensional pieces of same size into a larger box such that none of them can slide in any direction. In this paper, we consider the problem of how to find a sparsest anti-slide packing. We give an IP formulation of this problem, and obtain the solutions for some small cases by using an IP solver. In addition, we give the upper and lower bounds on the ratio of the volume occupied by the pieces when the size of a box approaches infinity. For the case of piece size 2 × 2 × 1, we show that a sparsest anti-slide packing occupies at least 28.8% and at most 66.7% of the total volume. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.252 ------------------------------ |
|||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | The anti-slide packing is a packing of a number of three dimensional pieces of same size into a larger box such that none of them can slide in any direction. In this paper, we consider the problem of how to find a sparsest anti-slide packing. We give an IP formulation of this problem, and obtain the solutions for some small cases by using an IP solver. In addition, we give the upper and lower bounds on the ratio of the volume occupied by the pieces when the size of a box approaches infinity. For the case of piece size 2 × 2 × 1, we show that a sparsest anti-slide packing occupies at least 28.8% and at most 66.7% of the total volume. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.252 ------------------------------ |
|||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AN00116647 | |||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 56, 号 5, 発行日 2015-05-15 |
|||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||
