Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
Hans Mittelmann
, Jiming Peng
Mathematical and Statistical Sciences, School of (SoMSS)
Research output
:
Contribution to journal
›
Article
›
peer-review
17
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Quadratic Assignment Problem
100%
Distance Matrix
89%
Hamming Distance
86%
Semidefinite Programming
83%
Semidefinite Programming Relaxation
60%
Matrix Splitting
20%
Open Source
20%
Facility Location
18%
Permutation Matrix
18%
Discrete Optimization
18%
Positive semidefinite
15%
Data Structures
14%
Hypercube
14%
Experimental Results
14%
Communication
13%
Grid
11%
Optimization Problem
10%
Lower bound
9%
Graph in graph theory
6%
Class
4%
Engineering & Materials Science
Hamming distance
92%
Relaxation
67%
Data structures
60%
Communication
36%