Special cases of the quadratic assignment problem

DOI10.1016/0377-2217(93)E0289-AzbMath0927.90083MaRDI QIDQ1129914

Bintong Chen

Publication date: 13 December 1999

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

zbMATH Keywords

quadratic assignmentlower and upper boundsnon-convex programsparametric programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (3)

A survey for the quadratic assignment problem ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Two classes of quadratic assignment problems that are solvable as linear assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• The facility layout problem
• Constrained global optimization: algorithms and applications
• Quadratic programming with one negative eigenvalue is NP-hard
• Linear multiplicative programming
• An operator theory of parametric programming for the transportation problem-I
• Complexity of some parametric integer and network programming problems
• Numerical investigations on quadratic assignment problems

This page was built for publication: Special cases of the quadratic assignment problem