Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study

DOI10.1287/ijoc.2017.0781OpenAlexW2800162969MaRDI QIDQ5131726

No author found.

Publication date: 9 November 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2017.0781

zbMATH Keywords

integer programmingnonlinear programmingheuristic algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Mathematical programming (90Cxx)

Related Items (2)

Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search

Uses Software

• QAPLIB
• LKH

Cites Work

• Unnamed Item
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem. Theory and algorithms
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The extended concentric tabu for the quadratic assignment problem
• Breakout local search for the quadratic assignment problem
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Iterated local search for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• P-Complete Approximation Problems

This page was built for publication: Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study