Data-Mining-Driven Neighborhood Search
From MaRDI portal
Publication:2815441
DOI10.1287/ijoc.1110.0451zbMath1462.90055OpenAlexW2025690249MaRDI QIDQ2815441
Michele Samorani, Manuel Laguna
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1110.0451
Uses Software
Cites Work
- Unnamed Item
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach
- A hybrid genetic/optimization algorithm for a task allocation problem
- Variable neighborhood search
- GRASP and path relinking for the matrix bandwidth minimization.
- Greedy randomized adaptive search procedures
- A hybrid heuristic to solve a task allocation problem
- A branch and bound algorithm for the matrix bandwidth minimization
- Exact Solutions to Task Allocation Problems
- Applications of the DM‐GRASP heuristic: a survey
- Scatter Search and Path Relinking: Advances and Applications
- A variable neighbourhood search algorithm for the constrained task allocation problem
- Reducing the bandwidth of a sparse matrix with tabu search.
This page was built for publication: Data-Mining-Driven Neighborhood Search