{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:24Z","timestamp":1761621264929},"reference-count":15,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"unspecified","delay-in-days":152,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2016]]},"abstract":"There is always a natural embedding of $S_{s}\\wr S_{k}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to prove that in the $2$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-level, strength-$1$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> case the LP relaxation permutation symmetry group of this formulation is isomorphic to $S_{2}\\wr S_{k}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> for all $k$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, and in the $2$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-level, strength-$2$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> case it is isomorphic to $S_{2}^{k}\\rtimes S_{k+1}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> for $k\\geqslant 4$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. The strength-$2$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> result reveals previously unknown permutation symmetries that cannot be captured by the natural embedding of $S_{2}\\wr S_{k}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. We also conjecture a complete characterization of the LP relaxation permutation symmetry group of the ILP formulation.<\/jats:p>Supplementary\u00a0materials\u00a0are\u00a0available\u00a0with\u00a0this\u00a0article.<\/jats:uri><\/jats:p>","DOI":"10.1112\/s1461157016000085","type":"journal-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T04:20:12Z","timestamp":1464841212000},"page":"206-216","source":"Crossref","is-referenced-by-count":2,"title":["The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program"],"prefix":"10.1112","volume":"19","author":[{"given":"David M.","family":"Arquette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dursun A.","family":"Bulutoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"S1461157016000085_r13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)91428-S"},{"key":"S1461157016000085_r10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.10.008"},{"key":"S1461157016000085_r7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0351-0"},{"key":"S1461157016000085_r4","unstructured":"4. The GAP\u00a0Group: \u2018GAP\u2014Groups, algorithms, and programming, version 4.6.4\u2019, 2013,http:\/\/www.gap-system.org."},{"key":"S1461157016000085_r5","unstructured":"5. A. Geyer , \u2018Different formulations of the orthogonal array problem and their symmetries\u2019. PhD Thesis, Air Force Institute of Technology, OH, 2014."},{"key":"S1461157016000085_r1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.11.009"},{"key":"S1461157016000085_r12","volume-title":"R: A Language and Environment for Statistical Computing","year":"2013"},{"key":"S1461157016000085_r9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0316-z"},{"key":"S1461157016000085_r3","unstructured":"3. D. Bulutoglu and K. Ryan , \u2018Integer programming for classifying orthogonal arrays\u2019, Preprint, 2016,arXiv:1501.02281."},{"key":"S1461157016000085_r11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"S1461157016000085_r14","volume-title":"An introduction to the theory of groups","author":"Rotman","year":"1994"},{"key":"S1461157016000085_r8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0394-6"},{"key":"S1461157016000085_r15","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001325"},{"key":"S1461157016000085_r2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2006.12.003"},{"key":"S1461157016000085_r6","first-page":"165","article-title":"The LP relaxation orthogonal array polytope and its permutation symmetries","volume":"91","author":"Geyer","year":"2014","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157016000085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:07:54Z","timestamp":1555704474000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157016000085\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016]]}},"alternative-id":["S1461157016000085"],"URL":"https:\/\/doi.org\/10.1112\/s1461157016000085","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}