globalCUT
globalCUT solves the Hamiltonian TSP for chip design, airline, trucking and routing applications. globalCUT is also objective-drive and adapts to constraints and dynamic changes in the problem specification.
Fast Solution for High-dimensional MaxCut Problems (TSP with Hamiltonian)
Why is it needed?
Solution of high-dimensional (500+) traveling salesman problem (TSP) and its more restrictive Hamiltonian form (MaxCut) require significant amount of computing power and time.
What does it do?
globalCUT provides a very fast solution for the MaxCut problem. The power and time requirement is measured to be near-linear function of the dimension of the problem.
How does it do it?
globalCUT starts with a fast, modified version nearest neighborhood approach, followed by an annealing process to impose the Hamiltonian form. The solution is further optimized through parallel processing for the shortest distance.
Who is it for?
- electrical engineers and circuit designers
- network engineers and IT specialists
- manufacturing engineers
- operations research analysts
- data center managers
- systems engineers
- and scientists solving optimization problems