Pages that link to "Item:Q3098287"
From MaRDI portal
The following pages link to Irregular Packing Using the Line and Arc No-Fit Polygon (Q3098287):
Displaying 16 items.
- Quasi-phi-functions and optimal packing of ellipses (Q288226) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- Phi-functions for 2D objects formed by line segments and circular arcs (Q447557) (← links)
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon. (Q1592584) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← 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)
- Parallel computing technologies for solving optimization problems of geometric design (Q2174043) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem (Q2338483) (← links)
- An improved method for calculating the no-fit polygon (Q2581595) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
- Optimized Object Packings Using Quasi-Phi-Functions (Q4634983) (← links)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
- A fast implementation for the 2D/3D box placement problem (Q5963685) (← links)
