The goal in Circle Optimization Problem is to determine the optimal plan to cut   a 2 dimensional   sheet   to   satisfy a   set   of   customers   demands.    Circle Optimization problems   may involve a  variety  of   objectives,   minimizing   trim loss,    maximizing  profit,   and [...]

A triangle is a 3-sided polygon. Every triangle has three sides and three angles, some of which may be   the same.   All triangles are convex.   Triangles can be classified according to the number of their equal   sides. A triangle with 3 equal sides is called equilateral, a triangle with 2 equal [...]

Packing problems   are optimization problems that are concerned with searching a  good arrangement   of multiple items   in   a   2d regions.  The usual objective   of the allocation is to maximise the material   utilization   and to minimize the wasted area.   This  is of  particular interest to industries involved with [...]

These programs optimize the cutting of pieces from plywood and other sheet stock — the greatest yield with the fewest number of cuts. This process is also referred to as rectangular nesting. Many of these programs produce layout diagrams, materials lists, cost estimates, and a variety of special reports. Determines optimal cutting layouts for linear [...]

Various algorithms used for optimisation

Technology used in MaxCut branches from several fields in Computer Science