Pages that link to "Item:Q3686413"

The following pages link to An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure (Q3686413):

Displaying 50 items.

• Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
• Minimum tiling of a rectangle by squares (Q1730580) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• MIP-based approaches for the container loading problem with multi-drop constraints (Q1761749) (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
• Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
• Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
• An exact algorithm for the pallet loading problem (Q1820701) (← links)
• Efficient automated pallet loading (Q1825763) (← links)
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
• Load planning for shipments of low density products (Q1825772) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
• An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
• A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip (Q1877898) (← links)
• A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
• Efficient heuristics for robot acquisition planning for a CIM system (Q1908995) (← links)
• MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
• Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
• Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (Q1974322) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container (Q2299015) (← links)
• The exact solutions of several types of container loading problems (Q2301942) (← links)
• An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
• A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473) (← links)
• A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)