Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1894381

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

zbMATH Open1042.90027MaRDI QIDQ4801580FDOQ4801580


Authors: Stefan Voß Edit this on Wikidata


Publication date: 2000



Title of this publication is not available (Why is that?)



Recommendations

  • A new heuristic for the quadratic assignment problem
  • Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
  • scientific article; zbMATH DE number 3922368
  • Heuristics for biquadratic assignment problems and their computational comparison
  • A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem


zbMATH Keywords

quadratic assignment problemheuristicmeta-heuristicquadratic semi-assignment problem


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)



Cited In (3)

  • A heuristic algorithm for nonlinear programming
  • An implementation of the iterated tabu search algorithm for the quadratic assignment problem
  • Algorithm for the discrete Weber's problem with an accuracy estimate





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4801580&oldid=19106546"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 00:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki