divide optimize optimalizing cut out size tailor blend waste offcut wastage cutting nested nesting Heuristic Branch and bound Simplex algorithm approximation algorithms distribute the whole

winvedaga distribute the whole thing similar the approximation algorithm. Loss Optimization (priority); then change optimization and order optimization. In the Programm are the algrrithm Branch and cut, Branch and bound and Simplex algorithm. You have wih this program less losses, less change in a whole, faster throughput of each section sizes (order) and less storage space required.