{"version":"1.0","type":"link","title":"Multi-fragment algorithm - Newikis","description":"The multi-fragment (MF) algorithm is a heuristic or approximation algorithm for the travelling salesman problem (TSP) (and related problems). This algorithm is also sometimes called the \"greedy algorithm\" for the TSP.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}