Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Solving the quadratic assignment problem by the repeated iterated tabu search method

From MaRDI portal
Publication:681911
Jump to:navigation, search

DOI10.1007/s10559-017-9930-xzbMath1384.90059OpenAlexW2603207849MaRDI QIDQ681911

P. V. Shylo

Publication date: 13 February 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-017-9930-x


zbMATH Keywords

tabu searchquadratic assignment problemcomparative study of algorithmscomputing experiment


Mathematics Subject Classification ID

Discrete location and assignment (90B80)


Related Items (2)

A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem ⋮ Solving the quadratic assignment problem



Cites Work

  • Unnamed Item
  • Quadratic assignment problems
  • The method of global equilibrium search
  • Breakout local search for the quadratic assignment problem
  • A cooperative parallel tabu search algorithm for the quadratic assignment problem
  • Iterated local search for the quadratic assignment problem
  • The Backboard Wiring Problem: A Placement Algorithm
  • Assignment Problems and the Location of Economic Activities
  • Hospital Layout as a Quadratic Assignment Problem


This page was built for publication: Solving the quadratic assignment problem by the repeated iterated tabu search method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:681911&oldid=12590238"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki