An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
© 2017 Informa UK Limited, trading as Taylor & Francis Group This article presents an efficient heuristic placement algorithm, namely, a bidirectional heuristic placement, for solving the two-dimensional rectangular knapsack packing problem. The heuristic demonstrates ways to maximize space ut...
Saved in:
Main Authors: | Shiangjen K., Chaijaruwanich J., Srisujjalertwaja W., Unachak P., Somhom S. |
---|---|
格式: | 雜誌 |
出版: |
2017
|
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018189956&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/40531 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
由: Kanokwatt Shiangjen, et al.
出版: (2018) -
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem
由: Kanokwatt Shiangjen, et al.
出版: (2018) -
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem
由: Kanokwatt Shiangjen, et al.
出版: (2018) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
由: Zhang, C.W., et al.
出版: (2014) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
由: Zhang, C.W., et al.
出版: (2014)