Pages that link to "Item:Q1751657"
From MaRDI portal
The following pages link to Matheuristics for the irregular bin packing problem with free rotations (Q1751657):
Displaying 12 items.
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations (Q6068729) (← links)
- The board packing problem (Q6167668) (← links)
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
- How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem (Q6586244) (← links)
