Pages that link to "Item:Q1027586"

The following pages link to Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586):

Displaying 35 items.

• Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• An exact strip packing algorithm based on canonical forms (Q339635) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
• On packing squares into a rectangle (Q634254) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← 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)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← 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)
• A reference length approach for the 3D strip packing problem (Q1926699) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Order and static stability into the strip packing problem (Q2259026) (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
• Constructive heuristics for the canister filling problem (Q2276059) (← links)
• An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
• Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)