To lay out or not to lay out?

DOI10.1007/s10479-011-1005-1zbMath1233.90243OpenAlexW2121750570MaRDI QIDQ763111

Sadegh Niroomand, Béla Vizvári, Szabolcs Takács

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)

Related Items (2)

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

Uses Software

• QAPLIB
• FANT

Cites Work

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

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