Pages that link to "Item:Q3098338"

The following pages link to An Exact Algorithm for the Two-Dimensional Strip-Packing Problem (Q3098338):

Displaying 20 items.

• A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← 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)
• The value of integrating loading and routing (Q1752774) (← links)
• Conservative scales in packing problems (Q1944876) (← 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)
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
• An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
• An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
• New Lower Bound and Exact Method for the Continuous Berth Allocation Problem (Q4971379) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)