To lay out or not to lay out?

DOI10.1007/S10479-011-1005-1MaRDI QIDQ763111zbMATH OpenOpenAlexFDO

Authors Sadegh Niroomand, Szabolcs Takács, B. Vizvári

Publication date 9 March 2012

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-011-1005-1

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1302195
• The quadratic assignment problem. Theory and algorithms
• A survey for the quadratic assignment problem
• scientific article; zbMATH DE number 1803767
• scientific article; zbMATH DE number 714526

Cites work

• A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• QAPLIB - a quadratic assignment problem library

Cited in

(2)

• Integrating combinatorial algorithms into a linear programming solver
• A belief degree-based uncertain scheme for a bi-objective two-stage green supply chain network design problem with direct shipment

Describes a project that uses

Uses Software

• FANT
• QAPLIB

This page was built for publication: To lay out or not to lay out?

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