Pages that link to "Item:Q2631240"

The following pages link to A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240):

Displaying 10 items.

• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
• Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
• Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems (Q2253410) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)