Lower bounds for the quadratic assignment problem via triangle decompositions

Authors:
Stefan E. Karisch;Franz Rendl
Affiliations:
-;-
Venue:
Mathematical Programming: Series A and B
Year:
1995

Citing 0
Cited 4

On the Applicability of Lower Bounds for Solving RectilinearQuadratic Assignment Problems in Parallel

Computational Optimization and Applications
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming

SIAM Journal on Optimization
A branch-and-bound algorithm for the single-row equidistant facility layout problem

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract