Pages that link to "Item:Q2384608"

The following pages link to The geometry of nesting problems: a tutorial (Q2384608):

Displaying 47 items.

• Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
• Quasi-phi-functions and optimal packing of ellipses (Q288226) (← links)
• Robust mixed-integer linear programming models for the irregular strip packing problem (Q323210) (← links)
• An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
• Algorithms for nesting with defects (Q406491) (← links)
• Phi-functions for 2D objects formed by line segments and circular arcs (Q447557) (← links)
• Decomposition algorithm for geometric objects in 2D packing and cutting problems (Q464977) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• Irregular stock cutting system based on AutoCAD (Q654369) (← links)
• Solution approaches to irregular nesting problems (Q1127203) (← 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 customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
• An emergent computation approach to the problem of polygon layout with performance constraints (Q1673263) (← links)
• A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems (Q1720775) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation (Q1754302) (← links)
• Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations (Q1756757) (← links)
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
• Optimal clustering of a pair of irregular objects (Q2018508) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Near optimal minimal convex hulls of disks (Q2046265) (← links)
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• Packing ovals in optimized regular polygons (Q2173521) (← links)
• Packing different cuboids with rotations and spheres into a cuboid (Q2260526) (← links)
• Mathematical modeling of the interaction of non-oriented convex polytopes (Q2263229) (← links)
• Mathematical model and efficient algorithms for object packing problem (Q2269838) (← 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)
• Extracting maximal objects from three-dimensional solid materials (Q2668729) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
• Foldabilizing furniture (Q2802320) (← links)
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry (Q2803270) (← links)
• A tutorial in irregular shape packing problems (Q3394054) (← links)
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← 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)
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry (Q6551075) (← links)
• Packaging optimization using the dynamic vector fields method (Q6554510) (← links)
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
• How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem (Q6586244) (← links)