Solves the Hamiltonian TSP for chip design, airline, trucking, and routing applications. Objective-driven and adapts to constraints and dynamic changes.
Solution of high-dimensional (500+) traveling salesman problem (TSP) and its more restrictive Hamiltonian form (MaxCut) require significant amount of computing power and time.
globalCUT provides a very fast solution for the MaxCut problem. The power and time requirement is measured to be a near-linear function of the dimension of the problem.
globalCUT starts with a fast, modified nearest neighborhood approach, followed by an annealing process to impose the Hamiltonian form. Further optimized via parallel processing for shortest distance.
Electrical engineers, circuit designers, network engineers, manufacturing engineers, operations research analysts, data center managers, systems engineers, and scientists solving optimization problems.