Pages that link to "Item:Q3394054"

The following pages link to A tutorial in irregular shape packing problems (Q3394054):

Displaying 26 items.

• An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
• Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
• Optimal clustering of a pair of irregular objects (Q2018508) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
• Irregular packing problems: a review of mathematical models (Q2286866) (← links)
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem (Q2307234) (← links)
• Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints (Q2356020) (← links)
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
• An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
• Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
• Heuristics for the two-dimensional irregular bin packing problem with limited rotations (Q6068729) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)