@Article{artacho2018feasibility,
  Title                    = {A feasibility approach for constructing combinatorial designs of circulant type},
  Author                   = {Arag{\'o}n Artacho, Francisco J and Campoy, Rub{\'e}n and Kotsireas, Ilias and Tam, Matthew K},
  Journal                  = {Journal of Combinatorial Optimization},
  Year                     = {2018},

  Arxiv                    = {https://arxiv.org/abs/1711.02502},
  Month                    = {May},
  Number                   = {4},
  Pages                    = {1061--1085},
  Volume                   = {35},

  Abstract                 = {In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas-Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler's table.},
  Doi                      = {https://doi.org/10.1007/s10878-018-0250-5},
  Timestamp                = {2017.11.07}
}

{"_id":"f9phFbk5SoSKTYLeA","bibbaseid":"aragnartacho-campoy-kotsireas-tam-afeasibilityapproachforconstructingcombinatorialdesignsofcirculanttype-2018","authorIDs":["5e348882fae8b9de0100017b","5e348c04fae8b9de010001d5","5e348ea0fae8b9de0100020e","5e348f3753b794de01000016"],"author_short":["Aragón Artacho, F. J","Campoy, R.","Kotsireas, I.","Tam, M. K"],"bibdata":{"bibtype":"article","type":"article","title":"A feasibility approach for constructing combinatorial designs of circulant type","author":[{"propositions":[],"lastnames":["Aragón","Artacho"],"firstnames":["Francisco","J"],"suffixes":[]},{"propositions":[],"lastnames":["Campoy"],"firstnames":["Rubén"],"suffixes":[]},{"propositions":[],"lastnames":["Kotsireas"],"firstnames":["Ilias"],"suffixes":[]},{"propositions":[],"lastnames":["Tam"],"firstnames":["Matthew","K"],"suffixes":[]}],"journal":"Journal of Combinatorial Optimization","year":"2018","arxiv":"https://arxiv.org/abs/1711.02502","month":"May","number":"4","pages":"1061–1085","volume":"35","abstract":"In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas-Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler's table.","doi":"https://doi.org/10.1007/s10878-018-0250-5","timestamp":"2017.11.07","bibtex":"@Article{artacho2018feasibility,\n Title = {A feasibility approach for constructing combinatorial designs of circulant type},\n Author = {Arag{\\'o}n Artacho, Francisco J and Campoy, Rub{\\'e}n and Kotsireas, Ilias and Tam, Matthew K},\n Journal = {Journal of Combinatorial Optimization},\n Year = {2018},\n\n Arxiv = {https://arxiv.org/abs/1711.02502},\n Month = {May},\n Number = {4},\n Pages = {1061--1085},\n Volume = {35},\n\n Abstract = {In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas-Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler's table.},\n Doi = {https://doi.org/10.1007/s10878-018-0250-5},\n Timestamp = {2017.11.07}\n}\n\n","author_short":["Aragón Artacho, F. J","Campoy, R.","Kotsireas, I.","Tam, M. K"],"key":"artacho2018feasibility","id":"artacho2018feasibility","bibbaseid":"aragnartacho-campoy-kotsireas-tam-afeasibilityapproachforconstructingcombinatorialdesignsofcirculanttype-2018","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"https://matthewktam.github.io/bibliography.bib","creationDate":"2020-01-31T20:05:22.494Z","downloads":0,"keywords":[],"search_terms":["feasibility","approach","constructing","combinatorial","designs","circulant","type","aragón artacho","campoy","kotsireas","tam"],"title":"A feasibility approach for constructing combinatorial designs of circulant type","year":2018,"dataSources":["ggbLmEcdfFCNZKWDe"]}