The Rank-One Quadratic Assignment Problem
From MaRDI portal
Publication:5085471
DOI10.1287/ijoc.2020.1003MaRDI QIDQ5085471
Aihua Yin, Zhipeng Lü, Jingbo Tian, Yang Wang, Abraham P. Punnen, Wei Yang
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1003
complexity; metaheuristics; quadratic assignment; polynomially solvable cases; integer-programming formulations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An FPTAS for optimizing a class of low-rank functions over a polytope
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Cut generation through binarization
- Quadratic programming and combinatorial minimum weight product problems
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- Linear multiplicative programming
- An algorithm for the quadratic assignment problem using Benders' decomposition
- The quadratic assignment problem. Theory and algorithms
- Weighted graphs with all Hamiltonian cycles of the same length
- Easy and difficult objective functions for max cut
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Breakout local search for the quadratic assignment problem
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- On linear multiplicative programming.
- The Quadratic Assignment Problem
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Assignment Problems and the Location of Economic Activities
- Resource-Constrained Assignment Scheduling
- The Complexity of Enumeration and Reliability Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
