Pages that link to "Item:Q2029021"

The following pages link to Exact solution techniques for two-dimensional cutting and packing (Q2029021):

Displaying 48 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• Cutting and packing optimization. Problems modeling and solution methods. (Q931915) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (Q2003558) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
• Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← 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)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
• A survey on the cutting and packing problems (Q2227258) (← links)
• A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
• L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• Exact solution of the two-dimensional finite bin packing problem (Q2783932) (← links)
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem (Q2892309) (← links)
• An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints (Q2942708) (← links)
• Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196) (← links)
• A new upper bound for unconstrained two-dimensional cutting and packing (Q4656659) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
• On the optimal layout of a dining room in the era of COVID‐19 using mathematical optimization (Q6060657) (← links)
• Rectangle packing with a recursive pilot method (Q6065652) (← links)
• Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
• Cargo securing under multi-drop and axle weight constraints (Q6106972) (← links)
• Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting (Q6568431) (← links)
• Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model (Q6568471) (← links)
• Models for two-dimensional bin packing problems with customer order spread (Q6621849) (← links)