Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting

Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting

10.1007/s10589-014-9663-y

Saved in:
Bibliographic Details
Main Authors: Peng, J., Zhu, T., Luo, H., Toh, K.-C.
Other Authors: MATHEMATICS
Format: Article
Published: 2016
Subjects:
Lower bound
Matrix splitting
Quadratic assignment problem (QAP)
Semi-definite programming (SDP)
Semi-definite relaxation (SDR)
Online Access:http://scholarbank.nus.edu.sg/handle/10635/126644
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/126644

Similar Items