EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Semi-definite relaxation (SDR)"
Narrow search

Narrow search

Year of publication
Subject
All
Lower bound 1 Matrix splitting 1 Quadratic assignment problem (QAP) 1 Semi-definite programming (SDP) 1 Semi-definite relaxation (SDR) 1
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Luo, Hezhi 1 Peng, Jiming 1 Toh, Kim-Chuan 1 Zhu, Tao 1
Published in...
All
Computational Optimization and Applications 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
Peng, Jiming; Zhu, Tao; Luo, Hezhi; Toh, Kim-Chuan - In: Computational Optimization and Applications 60 (2015) 1, pp. 171-198
Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408–3426, <CitationRef CitationID="CR25">2010</CitationRef>; Peng et...</citationref>
Persistent link: https://www.econbiz.de/10011151824
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...