Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
type: Item
instance of: scholarly article
title: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
zbMATH Open document ID: 0869.90075
DOI: 10.1007/BF00247211
author: Fred Glover
published in: Journal of Heuristics
publication date: 1997-09-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1019524
zbMATH Keywords: 4-opt moves
zbMATH Keywords: traveling salesman
zbMATH Keywords: acyclic shortest path model
MaRDI profile type: Publication
Recommended article: Reoptimizing the traveling salesman problem
Recommended article: A 4/5 -- approximation algorithm for the maximum traveling salesman problem
Recommended article: AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
Recommended article: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
Recommended article: Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood
Recommended article: Solving the \(k\)-best traveling salesman problem
Recommended article: Reoptimization of minimum and maximum traveling salesman's tours
Recommended article: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Recommended article: Nonoblivious 2-opt heuristics for the traveling salesman problem
Recommended article: Optimal bounds for the analytical traveling salesman problem
description: scientific article; zbMATH DE number 1019524