Breakout local search for the quadratic assignment problem

DOI10.1016/J.AMC.2012.10.106MaRDI QIDQ2350189zbMATH OpenOpenAlexFDO

Authors Una Benlic, Jin-Kao Hao

Publication date 18 June 2015

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.10.106

zbMATH Keywords

adaptive diversificationquadratic assignmentbreakout local searchlandscape analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1203226
• Iterated local search for the quadratic assignment problem
• On the quality of local search for the quadratic assignment problem
• Applying an extended guided local search to the quadratic assignment problem
• Local search in a quadratic-linear bilevel programming problem
• Breakout local search for maximum clique problems
• Publication:4506201
• Very large-scale neighborhood search for the quadratic assignment problem
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem

Cited in

(25)

• The Rank-One Quadratic Assignment Problem
• Knowledge discovery in graphs through vertex separation
• Solving the quadratic assignment problem
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
• Revisiting simulated annealing: a component-based analysis
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• A three-phased local search approach for the clique partitioning problem
• Solving the maximum vertex weight clique problem via binary quadratic programming
• Meta-heuristics and artificial intelligence
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Breakout local search for the multi-objective gate allocation problem
• Continuous quadratic programming formulations of optimization problems on graphs
• The bipartite quadratic assignment problem and extensions
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Partial neighborhood local searches
• A nonmonotone GRASP
• A multilevel bilinear programming algorithm for the vertex separator problem
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
• Fast simulated annealing for single-row equidistant facility layout
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Kernel technology to solve discrete optimization problems
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
• Solving the quadratic assignment problem by the repeated iterated tabu search method

Describes a project that uses

Uses Software

• Tabu search
• QAPLIB

This page was built for publication: Breakout local search for the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350189)