Pages that link to "Item:Q2884561"

The following pages link to An exact approach to the strip-packing problem (Q2884561):

Displaying 50 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)
• Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← 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)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
• A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
• Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
• Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
• Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• Reactive GRASP for the strip-packing problem (Q941532) (← links)
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
• Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• The problem of strip packing: An asymptotically exact approach (Q1282481) (← links)
• Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← 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 clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
• iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
• Minimum tiling of a rectangle by squares (Q1730580) (← links)
• The value of integrating loading and routing (Q1752774) (← 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)
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• A reference length approach for the 3D strip packing problem (Q1926699) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)