Description
Travelling Salesman Problem instances can be solved with a Concorde build that uses the GLPK backend. It is useful for researchers, optimization work, and experiments involving route or graph problems.
Optimization solvers can take significant CPU time and memory on large instances. Validate input data and solution quality before using results for real routing or planning decisions.