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. |
---|---|
Format: | Journal |
Published: |
2017
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018189956&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/40531 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
by: Kanokwatt Shiangjen, et al.
Published: (2018) -
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem
by: Kanokwatt Shiangjen, et al.
Published: (2018) -
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem
by: Kanokwatt Shiangjen, et al.
Published: (2018) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014)