Main public logs

Combined display of all available logs of IFORS Developing Countries Online Resources. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 02:04, 12 May 2026 Dcadmin talk contribs created page Double-ended nearest and loneliest neighbour–a nearest neighbour heuristic variation for the travelling salesman problem (Created page with "by: '''Fernando Guilherme Silvano Lobo Pimentel''' '''Abstract''' This paper presents a new tour construction heuristic for the travelling salesman problem that introduces the concept of loneliness of a city computed from the average distance of that city to all others and combines it with ideas from other nearest neighbour heuristics. Having the same time complexity of the faster nearest neighbour heuristics, the new method clearly leads to better tours, outperforming...")