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

A heuristic method for the quadratic assignment problem

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

zbMath1046.90069MaRDI QIDQ1429397

István Borgulya

Publication date: 18 May 2004

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)


zbMATH Keywords

global optimizationlocal searchevolutionary algorithm


Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (1)

Solving unconstrained binary quadratic programming problem by global equilibrium search


Uses Software

  • QAPLIB






This page was built for publication: A heuristic method for the quadratic assignment problem

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