Pages that link to "Item:Q3401326"
From MaRDI portal
The following pages link to A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326):
Displaying 17 items.
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A joint replenishment problem considering multiple trucks with shipment and resource constraints (Q342455) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Heuristics for packing semifluids (Q2286867) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces (Q2488910) (← links)
- A Modified Partially Mapped MultiCrossover Genetic Algorithm for Two-Dimensional Bin Packing Problem (Q3583088) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- A knapsack problem for rectangles under the gravity center constraints (Q5878628) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)
