POPMUSIC for the travelling salesman problem
type: Item
instance of: scholarly article
title: POPMUSIC for the travelling salesman problem
zbMATH Open document ID: 1403.90590
author: Éric D. Taillard
author: Keld Helsgaun
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
full work available at URL: author postprint.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6968069
zbMATH Keywords: travelling salesman
zbMATH Keywords: local search
zbMATH Keywords: POPMUSIC
zbMATH Keywords: large-scale optimization
zbMATH Keywords: metaheuristics
describes a project that uses: Concorde
describes a project that uses: DIMACS
describes a project that uses: POPMUSIC
MaRDI profile type: Publication
OpenAlex ID: W2810479212
cites work: POPMUSIC for the point feature label placement problem
cites work: Chained Lin-Kernighan for large traveling salesman problems
cites work: Multidimensional binary search trees used for associative searching
cites work: Q4801179
cites work: In Pursuit of the Traveling Salesman
cites work: Tour merging via branch-decomposition
cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
cites work: Q4875205
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: POPMUSIC for a real-world large-scale vehicle routing problem with time windows
cites work: The traveling salesman problem and its variations.
cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Heuristic methods for large centroid clustering problems
cites work: POPMUSIC -- partial optimization metaheuristic under special intensification conditions
Wikidata QID: Q129648440
DOI: 10.1016/J.EJOR.2018.06.039
description: scientific article; zbMATH DE number 6968069