A quadratic assignment problem without column constraints

DOI10.1002/NAV.3800160312MaRDI QIDQ5580104zbMATH OpenOpenAlexFDO

Authors Harold Greenberg

Publication date 1969

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800160312

zbMATH Keywords

operations research

Cites work

• Scheduling to Minimize Interaction Cost

Cited in

(6)

• Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
• An exact algorithm for the minimum squared load assignment problem
• The Boolean quadratic programming problem with generalized upper bound constraints
• The bipartite quadratic assignment problem and extensions
• A Lagrangian relaxation algorithm for sparse quadratic assignment problems
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search

This page was built for publication: A quadratic assignment problem without column constraints

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