On solving a hard quadratic 3-dimensional assignment problem
From MaRDI portal
Publication:2516353
DOI10.1007/s12532-015-0077-3zbMath1327.90140OpenAlexW2076533785MaRDI QIDQ2516353
Domenico Salvagnin, Hans D. Mittelmann
Publication date: 31 July 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3207910
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Linear programming based time lag identification in event sequences, A computational comparison of symmetry handling methods for mixed integer programs, Orbital shrinking: theory and applications, Hybrid algorithms for placement of virtual machines across geo-separated data centers
Uses Software
Cites Work
- Unnamed Item
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Exploiting orbits in symmetric ILP
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Iterated local search for the quadratic assignment problem
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
- Three Ideas for the Quadratic Assignment Problem
- Orbital Shrinking
- A new linearization method for quadratic assignment problems
- Symmetry in Integer Linear Programming
- On the size of optimal binary codes of length 9 and covering radius 1
- Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
- Letter to the Editor—The Multidimensional Assignment Problem
