< BACK TO NEWS
importantSYS.SOURCE: Georgia Tech ISYE2026-07-25T17:37:22Z

Combinatorial Applications of Sierpinski Spacefilling Curves in Optimization Problems

The article explores the use of Sierpinski spacefilling curves as a heuristic for solving the Traveling Salesman Problem (TSP), offering a fast, parallelizable approach with 25% longer tours compared to optimal solutions. It highlights real-world applications in logistics, mapping, and optimization, contrasting the heuristic's efficiency against computationally intensive methods.

Comments

Read original article

*** END OF TRANSMISSION ***