GRASP with path-relinking for the generalized quadratic assignment problem
From MaRDI portal
Publication:763245
DOI10.1007/s10732-010-9144-0zbMath1233.90213OpenAlexW2072270250MaRDI QIDQ763245
Ricardo M. A. Silva, Mauricio G. C. Resende, Geraldo Robson Mateus
Publication date: 9 March 2012
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9144-0
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, A three-phase matheuristic algorithm for the multi-day task assignment problem, An efficient compact quadratic convex reformulation for general integer quadratic programs, Extending time‐to‐target plots to multiple instances, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Restart strategies for GRASP with path-relinking heuristics, The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, GRASP with Path-Relinking for Facility Layout, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Memory and Learning in Metaheuristics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the generalized quadratic assignment problem
- A probabilistic heuristic for a computationally difficult set covering problem
- On the quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Location, scheduling, design and integer programming
- The volume algorithm: Producing primal solutions with a subgradient method
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Greedy randomized adaptive search procedures
- Solving large quadratic assignment problems on computational grids
- Probability distribution of solution time in GRASP: an experimental investigation
- Global optimization by continuous grasp
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- GRASP with Path Relinking for Three-Index Assignment
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- Mersenne twister
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A GRASP with path-relinking for private virtual circuit routing
