Pages that link to "Item:Q1754728"
From MaRDI portal
The following pages link to A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728):
Displaying 13 items.
- Beam search and non-linear programming tools for the circular packing problem (Q843379) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints (Q2356020) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← 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)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
