Exact solution of emerging quadratic assignment problems
From MaRDI portal
Publication:3002542
DOI10.1111/j.1475-3995.2010.00763.xzbMath1213.90155OpenAlexW2070737448MaRDI QIDQ3002542
Monique Guignard, Yi-Rong Zhu, James MacGregor Smith, Peter M. Hahn
Publication date: 20 May 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00763.x
Related Items
A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An algorithm for quadratic assignment problems
- An improved partial solution to the task assignment and multiway cut problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Solving large quadratic assignment problems in parallel
- Solution methods for the balancing of jet turbines
- Heuristics for biquadratic assignment problems and their computational comparison
- Effective algorithm and heuristic for the generalized assignment problem.
- Real-time dispatch of trams in storage yards
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- An algorithm for the multiprocessor assignment problem
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- An efficient cost scaling algorithm for the assignment problem
- On the Liu-Floudas convexification of smooth programs
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The Quadratic Assignment Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An Algorithm for the Three-Index Assignment Problem
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Letter to the Editor—The Multidimensional Assignment Problem
- The Distribution of Values in the Quadratic Assignment Problem
- Best reduction of the quadratic semi-assignment problem
- Approximate solutions to the turbine balancing problem.
