A new heuristic for the quadratic assignment problem

From MaRDI portal

Revision as of 18:04, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1428288

Jump to:navigation, search

DOI10.1155/S1173912602000093zbMath1134.90552MaRDI QIDQ1428288

Zvi Drezner

Publication date: 25 March 2004

Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/128772

Mathematics Subject Classification ID

Continuous location (90B85) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

New variable-length data compression scheme for solution representation of meta-heuristics ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Mapping the convergence of genetic algorithms ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1428288&oldid=13602912"