Pages that link to "Item:Q1877899"
From MaRDI portal
The following pages link to A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899):
Displaying 14 items.
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- A multi-objective programming approach to 1.5-dimensional assortment problem (Q858415) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
