Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
Abstract: This article studies the two-dimensional (2-D) rectangle packing area minimization problem (RPAMP), a key subproblem in floor planning for very large-scale integration (VLSI) chip design.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback