A dual framework for lower bounds of the quadratic assignment problem based on linearization
From MaRDI portal
Publication:1969301
DOI10.1007/s006070050040zbMath1138.90458OpenAlexW2040588207MaRDI QIDQ1969301
T. Espersen, Stefan E. Karisch, Jens Clausen, Eranda Çela
Publication date: 16 March 2000
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006070050040
Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A survey for the quadratic assignment problem, Bounds for the quadratic assignment problem using the bundle method, Sinkhorn Algorithm for Lifted Assignment Problems, Constrained 0-1 quadratic programming: basic approaches and extensions, Selected topics on assignment problems, An algorithm for the generalized quadratic assignment problem, A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem, Exact Solution of Two Location Problems via Branch-and-Bound, A revised reformulation-linearization technique for the quadratic assignment problem
Uses Software
