Improved discrete reformulations for the quadratic assignment problem

DOI10.1007/978-3-642-38171-3_13zbMATH Open1382.90048OpenAlexW224808017MaRDI QIDQ4922912FDOQ4922912

Authors: Axel Nyberg, Tapio Westerlund, 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

Recommendations

• A new exact discrete linear reformulation of the quadratic assignment problem
• New linearizations of quadratic assignment problems
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• Effective formulation reductions for the quadratic assignment problem
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem

zbMATH Keywords

combinatorial optimizationglobal optimizationquadratic assignment problemmixed integer programming

Mathematics Subject Classification ID

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

Cited In (6)

• A new exact discrete linear reformulation of the quadratic assignment problem
• New linearizations of quadratic assignment problems
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• Effective formulation reductions for the quadratic assignment problem

Uses Software

• QAPLIB

This page was built for publication: Improved discrete reformulations for the quadratic assignment problem

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