Making a state-of-the-art heuristic faster with data mining
From MaRDI portal
Publication:1639223
DOI10.1007/s10479-014-1693-4zbMath1390.90473OpenAlexW2082844239MaRDI QIDQ1639223
Alexandre Plastino, Daniel Martins, Gabriel M. Vianna, Simone L. Martins, Isabel Rosseti
Publication date: 12 June 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1693-4
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
MineReduce: an approach based on data mining for problem size reduction, A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive memory in multistart heuristics for multicommodity network design
- A note on solving large p-median problems
- Heuristic methods for large centroid clustering problems
- An evolutionary heuristic for quadratic 0-1 programming
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood decomposition search
- Metaheuristics: A bibliography
- TTT plots: a perl program to create time-to-target plots
- Hybridization of GRASP metaheuristic with data mining techniques
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- An annotated bibliography of GRASP-Part II: Applications
- Applications of the DM‐GRASP heuristic: a survey
- An annotated bibliography of GRASP – Part I: Algorithms
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- TSPLIB—A Traveling Salesman Problem Library
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Variable neighborhood search for the p-median
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Scatter Search and Path Relinking: Advances and Applications
- Integer Programming and the Theory of Grouping
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Cluster Analysis and Mathematical Programming
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Handbook of metaheuristics
- Tabu search for a network loading problem with multiple facilities
- Data mining. Concepts and techniques
