Geometric packing problems involve arranging objects of given shapes within a confined region so as to maximise density, minimise wasted space or satisfy prescribed distance and balance constraints.

The two-dimensional (2D) irregular packing problem is a combinatorial optimization problem with NP-complete characteristics, which is common in the production process of clothing, ships, and plate ...

While this three-step process is the ideal process of applied math, reality is more complicated. Once I reach the second step where I want the solution of the math problem, very often, if not most of ...