Pages that link to "Item:Q2901082"

The following pages link to A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem (Q2901082):

Displayed 22 items.

• A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) ‎ (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) ‎ (← links)
• An effective shaking procedure for 2D and 3D strip packing problems (Q336597) ‎ (← links)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) ‎ (← links)
• An exact strip packing algorithm based on canonical forms (Q339635) ‎ (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) ‎ (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) ‎ (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) ‎ (← links)
• A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) ‎ (← links)
• A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) ‎ (← links)
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) ‎ (← links)
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) ‎ (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) ‎ (← links)
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) ‎ (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) ‎ (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) ‎ (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) ‎ (← links)
• A reference length approach for the 3D strip packing problem (Q1926699) ‎ (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) ‎ (← links)
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) ‎ (← links)
• Data Structures for Higher-Dimensional Rectilinear Packing (Q2815459) ‎ (← links)
• An improved best-fit heuristic for the orthogonal strip packing problem (Q2862160) ‎ (← links)