About Cutting Optimization Problem
The cutting optimization problem belongs to the class of Nondeterminist Polynomial Complete (NP-Complete) problems [1], [2]. No polynomial-time algorithm is known for this kind of problems.
If you want to solve this problem perfectly your algorithm will run in exponential time. If you want to obtain a solution, to this problem, in a very short time your solution will be of poor quality.
Thus, one must employ a trade-off between the quality of the solutions and the running time.
Optimization 2D X applies latest Artificial Intelligence algorithms in order to obtain the best solutions in the shortest time possible.
References
[1]. Garey, M.R., Johnson D.S., Computers and Intractability: A Guide to NP-completeness, Freeman & Co, San Francisco, USA, 1979.
[2]. Cormen, T.H., Leiserson, C.E. Rivest, R. R., Introduction to Algorithms, MIT Press, Cambridge, MA, USA, 1990.