2013
DOI: 10.1016/j.tcs.2012.07.035
|View full text |Cite
|
Sign up to set email alerts
|

2D knapsack: Packing squares

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…The 2D-KP problem is one of the most classical problems in the combinatorial optimization field and has a lot of applications in the real world [28]. In the 2D-KP problem, each item has a corresponding profit, and one needs to select a subset of items to be packed in a single bin to maximize the total profit of selected items [22].…”
Section: Problem Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…The 2D-KP problem is one of the most classical problems in the combinatorial optimization field and has a lot of applications in the real world [28]. In the 2D-KP problem, each item has a corresponding profit, and one needs to select a subset of items to be packed in a single bin to maximize the total profit of selected items [22].…”
Section: Problem Descriptionmentioning
confidence: 99%
“…In addition, the parameter λ is defined to determine the number of vehicles to be packed |I | based on the assumption 3), where λ is an arbitrary real number in (0, 1] in order to ensure that there are sufficient vehicles to be packed. Given a value of the parameter λ, there is a unique that meets inequalities (28) and (29) at the same time. The smaller the λ value, the larger |I | is.…”
Section: Computational Study a Experimental Designmentioning
confidence: 99%