Mathematica provides industrial-strength state-of-the-art combinatorial optimization capabilities, such as mixed integer linear programming and traveling salesman problem (TSP) optimization. Problems can be given in convenient symbolic form, and results used immediately in other computations, visualizations, etc.

• Fully scalable algorithms, routinely handling thousands of variables.
• Support for arbitrary TSP metrics, including strings, d dimensions, etc.
• Support for import of MPS problem files.

Solve Traveling Salesman Problems	Find 3D Shortest Paths	Find Real-World Shortest Paths
Find Shortest Paths in String Space	Solve Integer Programming Problems