New linearizations of quadratic assignment problems

DOI10.1016/j.cor.2012.02.017zbMath1251.90293MaRDI QIDQ1761235

Stephen E. Wright

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.017

zbMATH Keywords

matrix splitting; mixed-integer linear programming; \texttt{QAPLIB}

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C20: Quadratic programming

90C27: Combinatorial optimization

Related Items

Generating QAP instances with known optimum solution and additively decomposable cost function, Selection hyper-heuristics for the multi and many-objective quadratic assignment problem

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-standard approaches to integer programming
• Cutting planes in integer and mixed integer programming
• Studies on directed graphs. I, II
• A theorem on flows in networks
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• Effective formulation reductions for the quadratic assignment problem
• Partitioning procedures for solving mixed-variables programming problems
• On the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• Solving large quadratic assignment problems in parallel
• The quadratic assignment problem. Theory and algorithms
• Recent advances in the solution of quadratic assignment problems
• Solving large quadratic assignment problems on computational grids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the degrees of the vertices of a directed graph
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• The Quadratic Assignment Problem
• Combinatorial Properties of Matrices of Zeros and Ones
• Matrices of zeros and ones
• Assignment Problems and the Location of Economic Activities
• The Decomposition Algorithm for Linear Programs
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• P-Complete Approximation Problems
• Comparison of iterative searches for the quadratic assignment problem
• Introduction to Stochastic Programming
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition