The quadratic three-dimensional assignment problem: exact and approximate solution methods

DOI10.1016/J.EJOR.2006.11.014zbMath1149.90364OpenAlexW2013551243MaRDI QIDQ2384611

Peter M. Hahn, Zhi Ding, Harvind Samra, Thomas Stützle, Bum-Jin Kim, Sebastian Kanthak, Monique Guignard, William L. Hightower

Publication date: 10 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.014

zbMATH Keywords

heuristicsbranch-and-boundQuadratic assignmentOR in telecommunicationsthree-index assignment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (10)

PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID ⋮ A survey for the quadratic assignment problem ⋮ On the Hamming distance in combinatorial optimization problems on hypergraph matchings ⋮ The multi-story space assignment problem ⋮ Coordinated lab-clinics: a tactical assignment problem in healthcare ⋮ Probabilistic tabu search for the cross-docking assignment problem ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ Lower bounds for the axial three-index assignment problem

Uses Software

• QAPLIB
• FANT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• QAPLIB-A quadratic assignment problem library
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Iterated local search for the quadratic assignment problem
• Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
• The Quadratic Assignment Problem
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Assignment Problems and the Location of Economic Activities
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
• Equation of State Calculations by Fast Computing Machines
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: The quadratic three-dimensional assignment problem: exact and approximate solution methods