Name
Abstract | ||
|---|---|---|
We show how to express the problem of searching for D-optimal matrices as a Linear and Quadratic Integer Optimization problem. We also focus our attention in the case where the size of the circulant submatrices that are used to construct a D-optimal matrix is a multiple of 3. In this particular case, we describe some additional combinatorial and number-theoretic characteristics that a solution of the D-optimal matrix problem must possess. We give some solutions for some quite challenging D-optimal matrix problems that can be used as benchmarks to test the efficiency of Linear and Quadratic Integer Optimization algorithms. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10732-011-9173-3 | J. Heuristics |
Keywords | Field | DocType |
Periodic autocorrelation function,Linear and quadratic integer optimization,Algorithms | Mathematical optimization,Quadratically constrained quadratic program,Matrix (mathematics),Quadratic assignment problem,Integer programming,Quadratic programming,Integer matrix,Unimodular matrix,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
19 | 4 | 1381-1231 |
Citations | PageRank | References |
1 | 0.48 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. S. Kotsireas | 1 | 19 | 3.83 |
| Panos M. Pardalos | 2 | 698 | 98.99 |