About the Cutting Optimization pro
The cutting optimization problem belongs to the class of Nondeterministic Polynomial Complete (NP-Complete) problems [1], [2]. No polynomial-time algorithm is known for these kind of problems.
If you want to solve this problem perfectly your algorithm will run in exponential time. So, you must employ a trade-off between the quality of the solutions and the running time.
Cutting Optimization Pro applies 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.
Links