scispace - formally typeset
Open AccessJournal ArticleDOI

Computational experiments with some approximation algorithms for the travelling salesman problem

A. Adrabiński, +1 more
- 01 Jan 1983 - 
- Vol. 18, Iss: 1, pp 91-95
About
This article is published in Applicationes Mathematicae.The article was published on 1983-01-01 and is currently open access. It has received 12 citations till now. The article focuses on the topics: Christofides algorithm & Bottleneck traveling salesman problem.

read more

Content maybe subject to copyright    Report

Citations
More filters

On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms

Pablo Moscato
TL;DR: In this paper, the authors present a short abstract, which is a summary of the paper.Short abstract, isn't it? But it is short abstracts, not abstracts.
Journal ArticleDOI

An effective implementation of the Lin–Kernighan traveling salesman heuristic

TL;DR: An implementation of the Lin–Kernighan heuristic, one of the most successful methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem (TSP), is described.
Journal ArticleDOI

On the Significance of the Initial Solution in Travelling Salesman Heuristics

TL;DR: Computational results show that the use of initial solutions generated by applying a construction heuristic, instead of random initial solutions, typically improves the performance of edge exchange heuristics.
Journal ArticleDOI

A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops

TL;DR: A penalty-based construction algorithm for the no-wait flow shop scheduling problem with the objective of minimizing makespan and total flow time of jobs and is derived from Hungarian penalty method originally used for the classic assignment problem.
Proceedings ArticleDOI

An efficient mobile sink scheduling method for data collection in wireless sensor networks

TL;DR: A method, termed the Heuristic Algorithm, is proposed to prolong the lifetime of wireless sensor networks and results show that the proposed method performs better than other existing method.
Related Papers (5)