Making a state-of-the-art heuristic faster with data mining
type: Item
instance of: scholarly article
title: Making a state-of-the-art heuristic faster with data mining
zbMATH Open document ID: 1390.90473
author: Daniel Martins
author: Gabriel M. Vianna
author: Isabel Rosseti
author: Simone L. Martins
author: Alexandre Plastino
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6886402
zbMATH Keywords: hybrid metaheuristics
zbMATH Keywords: \(p\)-median problem
zbMATH Keywords: data mining
describes a project that uses: TSPLIB
describes a project that uses: GRASP
describes a project that uses: TTTPLOTS
describes a project that uses: PERL
describes a project that uses: OR-Library
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: s10479-014-1693-4
OpenAlex ID: W2082844239
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
cites work: TTT plots: a perl program to create time-to-target plots
cites work: Adaptive memory in multistart heuristics for multicommodity network design
cites work: A note on solving large p-median problems
cites work: Tabu search for a network loading problem with multiple facilities
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: An annotated bibliography of GRASP-Part II: Applications
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: Handbook of metaheuristics
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: Fundamentals of scatter search and path relinking
cites work: Scatter Search and Path Relinking: Advances and Applications
cites work: Cluster Analysis and Mathematical Programming
cites work: Metaheuristics: A bibliography
cites work: Data mining. Concepts and techniques
cites work: Variable neighborhood search for the p-median
cites work: Variable neighborhood decomposition search
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An evolutionary heuristic for quadratic 0-1 programming
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4452897
cites work: Hybridization of GRASP metaheuristic with data mining techniques
cites work: Applications of the DM‐GRASP heuristic: a survey
cites work: Heuristic methods for large centroid clustering problems
cites work: State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: Integer Programming and the Theory of Grouping
cites work: Q5312442
DOI: 10.1007/S10479-014-1693-4
description: scientific article; zbMATH DE number 6886402