Anti-Slide

• Amano Kazuyuki

  Department of Computer Science, Gunma University

• Nakano Shin-ichi

  Department of Computer Science, Gunma University

• Yamazaki Koichi

  Department of Computer Science, Gunma University

Abstract

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.

Journal

• Journal of Information Processing

  Journal of Information Processing 23 (3), 252-257, 2015

  Information Processing Society of Japan

Keywords

• anti-slide packing
• integer programming
• IP solver
• puzzle

Details

• CRID: 1390282680271924480
• NII Article ID: 130005070060
• NII Article ID: 170000130632
• NII Book ID: AN00116647
• ISSN: 18827764
• ISSN: 18826652
• DOI: 10.2197/ipsjjip.23.252
• Web Site: http://id.nii.ac.jp/1001/00142000/
• Web Site: https://www.jstage.jst.go.jp/article/ipsjjip/23/3/23_252/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed