{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:14:51Z","timestamp":1772266491856,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,11,28]],"date-time":"2014-11-28T00:00:00Z","timestamp":1417132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-014-0843-4","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T13:30:02Z","timestamp":1417527002000},"page":"529-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A semidefinite programming hierarchy for packing problems in discrete geometry"],"prefix":"10.1007","volume":"151","author":[{"given":"David","family":"de Laat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Vallentin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,28]]},"reference":[{"key":"843_CR1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.2307\/2371787","volume":"68","author":"R Arens","year":"1946","unstructured":"Arens, R.: Topologies for homeomorphism groups. Am. J. Math. 68, 593\u2013610 (1946)","journal-title":"Am. J. Math."},{"key":"843_CR2","doi-asserted-by":"crossref","unstructured":"Bachoc, C., Gijswijt, D.C., Schrijver, A., Vallentin, F.: Invariant semidefinite programs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 219\u2013269. Springer, Berlin (2012). http:\/\/arxiv.org\/abs\/1007.2905","DOI":"10.1007\/978-1-4614-0769-0_9"},{"key":"843_CR3","doi-asserted-by":"crossref","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing numbers from semidefinite programming. J. Am. Math. Soc. 21, 909\u2013924 (2008). http:\/\/arxiv.org\/abs\/math\/0608426","DOI":"10.1090\/S0894-0347-07-00589-9"},{"key":"843_CR4","doi-asserted-by":"crossref","unstructured":"Bachoc, C., Nebe, G., de Oliveira Filho, F.M., Vallentin, F.: Lower bounds for measurable chromatic numbers. Geom. Funct. Anal. 19, 645\u2013661 (2009). http:\/\/arxiv.org\/abs\/0801.1059","DOI":"10.1007\/s00039-009-0013-7"},{"key":"843_CR5","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity. Grad. Stud. Math., vol. 54, American Mathematical Society (2002)","DOI":"10.1090\/gsm\/054"},{"key":"843_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1128-0","volume-title":"Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions","author":"C Berg","year":"1984","unstructured":"Berg, C., Christensen, J.P.R., Ressel, P.: Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions. Springer, Berlin (1984)"},{"key":"843_CR7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1090\/S0002-9904-1931-05290-3","volume":"37","author":"K Borsuk","year":"1931","unstructured":"Borsuk, K., Ulam, S.: On symmetric products of topological spaces. Bull. Am. Math. Soc. 37, 875\u2013882 (1931)","journal-title":"Bull. Am. Math. Soc."},{"key":"843_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"843_CR9","doi-asserted-by":"crossref","unstructured":"Cohn, H., Elkies, N.D.: New upper bounds on sphere packings I. Ann. Math. 157, 689\u2013714 (2003). http:\/\/arxiv.org\/abs\/math\/0110009","DOI":"10.4007\/annals.2003.157.689"},{"key":"843_CR10","doi-asserted-by":"crossref","unstructured":"Cohn, H., Woo, J.: Three-point bounds for energy minimization. J. Am. Math. Soc. 25, 929\u2013958 (2012). http:\/\/arxiv.org\/abs\/1103.0485","DOI":"10.1090\/S0894-0347-2012-00737-1"},{"key":"843_CR11","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. vi+97 (2012)"},{"key":"843_CR12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P Delsarte","year":"1977","unstructured":"Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geometriae Dedicata 6, 363\u2013388 (1977)","journal-title":"Geometriae Dedicata"},{"key":"843_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02052480","volume":"163","author":"J Dieudonn\u00e9","year":"1966","unstructured":"Dieudonn\u00e9, J.: Sur la s\u00e9paration des ensembles convexes. Math. Ann. 163, 1\u20133 (1966)","journal-title":"Math. Ann."},{"key":"843_CR14","unstructured":"de Laat, D., de Oliveira Filho, F.M., Vallentin, F.: Upper Bounds for Packings of Spheres of Several Radii. Forum Math. (2012, to appear). http:\/\/arxiv.org\/abs\/1206.2608"},{"key":"843_CR15","unstructured":"de Oliveira Filho, F.M., Vallentin, F.: Computing Upper Bounds for Packing Densities of Congruent Copies of a Convex Body I. (preprint) (2013). http:\/\/arxiv.org\/abs\/1308.4893"},{"key":"843_CR16","volume-title":"A Course in Abstract Harmonic Analysis. Studies in Advanced Mathematics","author":"GB Folland","year":"1995","unstructured":"Folland, G.B.: A Course in Abstract Harmonic Analysis. Studies in Advanced Mathematics. CRC Press, Boca Raton (1995)"},{"key":"843_CR17","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D Gijswijt","year":"2006","unstructured":"Gijswijt, D., Schrijver, A., Tanaka, H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory Ser. A 113, 1719\u20131731 (2006)","journal-title":"J. Comb. Theory Ser. A"},{"key":"843_CR18","doi-asserted-by":"crossref","unstructured":"Gijswijt, D., Mittelmann, H.D., Schrijver, A.: Semidefinite code bounds based on quadruple distances. IEEE Trans. Inf. Theory 58, 2697\u20132705 (2012). http:\/\/arxiv.org\/abs\/1005.4959","DOI":"10.1109\/TIT.2012.2184845"},{"key":"843_CR19","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.4007\/annals.2005.162.1065","volume":"162","author":"TC Hales","year":"2005","unstructured":"Hales, T.C.: A proof of the Kepler conjecture. Ann. Math. 162, 1065\u20131185 (2005)","journal-title":"Ann. Math."},{"key":"843_CR20","first-page":"747","volume":"26","author":"D Handel","year":"2000","unstructured":"Handel, D.: Some homotopy properties of spaces of finite subsets of topological spaces. Houst. J. Math. 26, 747\u2013764 (2000)","journal-title":"Houst. J. Math."},{"key":"843_CR21","unstructured":"Hoffman, A.J.: On eigenvalues and colorings of graphs. In B. Harris (Ed.), Graph Theory and Its Applications, pp. 79\u201391. Academic Press, London (1970)"},{"key":"843_CR22","first-page":"3","volume":"14","author":"GA Kabatiansky","year":"1978","unstructured":"Kabatiansky, G.A., Levenshtein, V.I.: On bounds for packings on a sphere and in space. Probl. Peredachi Inf. 14, 3\u201325 (1978)","journal-title":"Probl. Peredachi Inf."},{"key":"843_CR23","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"843_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1090\/S0002-9939-1955-0068113-7","volume":"6","author":"VL Klee Jr","year":"1955","unstructured":"Klee Jr, V.L.: Separation properties of convex cones. Proc. Am. Math. Soc. 6, 313\u2013318 (1955)","journal-title":"Proc. Am. Math. Soc."},{"key":"843_CR25","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12, 756\u2013769 (2002)","journal-title":"SIAM J. Optim."},{"key":"843_CR26","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28, 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"843_CR27","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Strengthened semidefinite programming bounds for codes. Math. Program. Ser. B 109, 239\u2013261 (2007)","DOI":"10.1007\/s10107-006-0030-3"},{"key":"843_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/2035991","volume":"20","author":"B Lindstr\u00f6m","year":"1969","unstructured":"Lindstr\u00f6m, B.: Determinants on semilattices. Proc. Am. Math. Soc. 20, 207\u2013208 (1969)","journal-title":"Proc. Am. Math. Soc."},{"key":"843_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Th. 25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Th."},{"key":"843_CR30","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"843_CR31","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 42, 969\u2013984 (1993)","journal-title":"Ind. Univ. Math. J."},{"key":"843_CR32","unstructured":"Regts, G.: Upper Bounds for Ternary Constant Weight Codes from Semidefinite Programming and Representation Theory. Master thesis, University of Amsterdam (2009)"},{"key":"843_CR33","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"843_CR34","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"843_CR35","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"843_CR36","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1038\/nature08239","volume":"460","author":"S Torquato","year":"2009","unstructured":"Torquato, S., Jiao, Y.: Dense packings of the Platonic and Archimedean solids. Nature 460, 876\u2013879 (2009)","journal-title":"Nature"},{"key":"843_CR37","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1090\/S0002-9904-1968-12104-4","volume":"74","author":"HS Wilf","year":"1968","unstructured":"Wilf, H.S.: Hadamard determinants, M\u00f6bius functions, and the chromatic number of a graph. Bull. Am. Math. Soc. 74, 960\u2013964 (1968)","journal-title":"Bull. Am. Math. Soc."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0843-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0843-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0843-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0843-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,28]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0843-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,28]]}}}