Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access


    A Time-Efficient and Exploratory Algorithm for the Rectangle Packing Problem

    Mohammad Bozorgi1, Morteza Mohammadi Zanjireh1,*, Mahdi Bahaghighat1, Qin Xin2

    Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 885-898, 2022, DOI:10.32604/iasc.2022.016075

    Abstract Today, resource waste is considered as one of the most important challenges in different industries. In this regard, the Rectangle Packing Problem (RPP) can affect noticeably both time and design issues in businesses. In this study, the main objective is to create a set of non-overlapping rectangles so that they have specific dimensions within a rectangular plate with a specified width and an unlimited height. The ensued challenge is an NP-complete problem. NP-complete problem, any of a class of computational problems that still there are no efficient solution for them. Most substantial computer-science problems such as the traveling salesman problem,… More >

Displaying 1-10 on page 1 of 1. Per Page  

Share Link