Improved Discrete Reformulations for the Quadratic Assignment Problem

DOI10.1007/978-3-642-38171-3_13zbMath1382.90048OpenAlexW224808017MaRDI QIDQ4922912

Tapio Westerlund, Axel Nyberg, Andreas Lundell

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_13

zbMATH Keywords

global optimizationcombinatorial optimizationquadratic assignment problemmixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

Uses Software

• QAPLIB

This page was built for publication: Improved Discrete Reformulations for the Quadratic Assignment Problem