scientific article

From MaRDI portal

Publication:3039069

Jump to:navigation, search

zbMath0525.90095MaRDI QIDQ3039069

Andrzej Adrabinski, Maciej M. Sysło

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimization computational experiments heuristic algorithms travelling salesman problem comparison of algorithms Lin-Kernighan algorithm farthest insertion method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (4)

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic ⋮ A useful transform of standard input data for a classical NP-complete problem ⋮ On the refinement of bounds of heuristic algorithms for the traveling salesman problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3039069&oldid=16076263"