Pages that link to "Item:Q296697"

The following pages link to A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697):

Displaying 15 items.

• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
• A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← 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)
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems (Q2253410) (← links)
• The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
• A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• (Q3008996) (← links)
• A morph-based simulated annealing heuristic for a modified bin-packing problem (Q4363746) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)