Pages that link to "Item:Q2253410"
From MaRDI portal
The following pages link to A goal-driven approach to the 2D bin packing and variable-sized bin packing problems (Q2253410):
Displaying 13 items.
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
- Sequential heuristic for the two-dimensional bin-packing problem (Q2629597) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
