Multi-fragment algorithm
id:
multi-fragment-algorithm-227-991815
title:
Multi-fragment algorithm
text:
The multi-fragment (MF) algorithm is a heuristic or approximation algorithm for the travelling salesman problem (TSP). This algorithm is also sometimes called the "greedy algorithm" for the TSP. The algorithm builds a tour for the traveling salesman one edge at a time and thus maintains multiple tour fragments, each of which is a simple path in the complete graph of cities. At each stage, the algorithm selects the edge of minimal cost that either creates a new fragment, extends one of the existi
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Multi-fragment_algorithm
date created:
2018-11-12T11:29:51Z
date modified:
2024-09-14T23:39:44Z
main entity:
{"identifier":"Q60786367","url":"https://www.wikidata.org/entity/Q60786367"}
image:
fields total:
13
integrity:
14