{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:33Z","timestamp":1772120133692,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00214-7","type":"journal-article","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T06:03:19Z","timestamp":1680156199000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spreading Points Using Gradient and Tabu"],"prefix":"10.1007","volume":"4","author":[{"given":"Xiangyang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiGuo","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"key":"214_CR1","unstructured":"Croft HT, Falconer KJ, Guy RK (2012) Unsolved problems in geometry: Unsolved problems in intuitive mathematics (vol. 2), Springer Science & Business Media"},{"key":"214_CR2","doi-asserted-by":"crossref","unstructured":"Hifi M, M\u2019hallah R (2009) A literature review on circle and sphere packing problems: Models and methodologies. Adv Oper Res\u00a02009(150624):1\u201322","DOI":"10.1155\/2009\/150624"},{"key":"214_CR3","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo I, Kampas FJ, Pint\u00e9r JD (2008) Solving circle packing problems by global optimization: Numerical results and industrial applications. Eur J Oper Res 191:786\u2013802","journal-title":"Eur J Oper Res"},{"key":"214_CR4","doi-asserted-by":"crossref","unstructured":"Huang XY, Huang LG, Zhang SD, Zhou LJ, Wu MH, Chen MR (2017) Improving random test sets using a locally spreading approach, In: Proceedings of the IEEE International Conference on Software Quality, Reliability and Security (QRS), pp 32-41","DOI":"10.1109\/QRS.2017.13"},{"key":"214_CR5","first-page":"81","volume":"5","author":"JM Renes","year":"2005","unstructured":"Renes JM (2005) Equiangular spherical codes in quantum cryptography. Quantum Inf Comput 5:81\u201392","journal-title":"Quantum Inf Comput"},{"key":"214_CR6","unstructured":"Zhou X et al (2022) Learning towards the largest margins. In: International Conference on Learning Representations (ICLR)"},{"key":"214_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst R, Thoai NV (1999) DC programming: Overview. J Optim Theory Appl 103:1\u201343","journal-title":"J Optim Theory Appl"},{"key":"214_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M Locatelli","year":"2002","unstructured":"Locatelli M, Raber U (2002) Packing equal circles in a square: a deterministic global optimization approach. Discret Appl Math 122:139\u2013166","journal-title":"Discret Appl Math"},{"key":"214_CR9","doi-asserted-by":"publisher","first-page":"R46","DOI":"10.37236\/1524","volume":"7","author":"DW Boll","year":"2000","unstructured":"Boll DW, Donovan J, Graham RL, Lubachevsky BD (2000) Improving dense packings of equal disks in a square. Electron J Combin 7:R46","journal-title":"Electron J Combin"},{"key":"214_CR10","doi-asserted-by":"crossref","unstructured":"Casado LG, Garc\u00eda I, Szab\u00f3 PG, Csendes T (2001) Packing equal circles in a square II. - new results for up to 100 circles using the TAMSASS-PECS algorithm. In: Giannessi F, Pardalos P, Rapcs\u00e1k T (eds) Optimization Theory, Applied Optimization (vol. 59), Springer, Boston, MA","DOI":"10.1007\/978-1-4613-0295-7_15"},{"key":"214_CR11","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","volume":"32","author":"N Mladenovi\u0107","year":"2005","unstructured":"Mladenovi\u0107 N, Plastria F, Uro\u0161evi\u0107 D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32:2419\u20132434","journal-title":"Comput Oper Res"},{"key":"214_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/PL00009306","volume":"18","author":"KJ Nurmela","year":"1997","unstructured":"Nurmela KJ, \u00d6sterg\u00e5rd PRJ (1997) Packing up to 50 equal circles in a square. Discrete Comput Geometry 18:111\u2013120","journal-title":"Discrete Comput Geometry"},{"key":"214_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1026500301312","volume":"18","author":"RH Leary","year":"2000","unstructured":"Leary RH (2000) Global optimization on funneling landscapes. J Glob Optim 18:367\u2013383","journal-title":"J Glob Optim"},{"key":"214_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/B:JOGO.0000015313.93974.b0","volume":"28","author":"K Yiu","year":"2004","unstructured":"Yiu K, Liu Y, Teo K (2004) A hybrid descent method for global optimization. J Glob Optim 28:229\u2013238","journal-title":"J Glob Optim"},{"issue":"4","key":"214_CR15","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/ijoc.1080.0263","volume":"20","author":"B Addis","year":"2008","unstructured":"Addis B, Locatelli M, Schoen F (2008) Disk packing in a square: a new global optimization approach. INFORMS J Comput 20(4):516\u2013524","journal-title":"INFORMS J Comput"},{"key":"214_CR16","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1021\/jp970984n","volume":"101","author":"DJ Wales","year":"1997","unstructured":"Wales DJ, Doye JPK (1997) Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J Phys Chem A 101:5111\u20135116","journal-title":"J Phys Chem A"},{"key":"214_CR17","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.cor.2012.08.019","volume":"40","author":"R M\u2019Hallah","year":"2013","unstructured":"M\u2019Hallah R, Alkandari A, Mladenovic N (2013) Packing unit spheres into the smallest sphere using VNS and NLP. Comput Oper Res 40:603\u2013615","journal-title":"Comput Oper Res"},{"key":"214_CR18","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.orl.2022.01.013","volume":"50","author":"XY Huang","year":"2022","unstructured":"Huang XY, Zhang SD, Zhou LJ, Huang LG (2022) A hybrid algorithm for the minimum bounding sphere problem. Oper Res Lett 50:150\u2013154","journal-title":"Oper Res Lett"},{"key":"214_CR19","unstructured":"Badoiu M, Clarkson KL (2002) Optimal core sets for balls. In: DIMACS Workshop on Computational Geometry"},{"key":"214_CR20","doi-asserted-by":"crossref","unstructured":"Clarkson K (2010) Coresets, sparse greedy approximation, and the Frank-Wolfe Algorithm. ACM Trans Algo\u00a040:14\u201322","DOI":"10.1145\/1824777.1824783"},{"issue":"1","key":"214_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1137\/080737551","volume":"51","author":"J Cort\u00e9s","year":"2009","unstructured":"Cort\u00e9s J, Bullo F (2009) Nonsmooth coordination and geometric optimization via distributed dynamical systems. SIAM Rev 51(1):163\u2013189","journal-title":"SIAM Rev"},{"key":"214_CR22","volume-title":"Introduction to Minimax","author":"V Dem\u00fdanov","year":"1974","unstructured":"Dem\u00fdanov V, Malozemov V (1974) Introduction to Minimax. Dover, New York"},{"key":"214_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell, MA"},{"issue":"1","key":"214_CR24","first-page":"7","volume":"158","author":"L Pronzato","year":"2017","unstructured":"Pronzato L (2017) Minimax and maximin space-filling designs: some properties and methods for construction. Journal de la Societe Fran\u00e7aise de Statistique, Societe Fran\u00e7aise de Statistique et Societe Mathematique de France 158(1):7\u201336","journal-title":"Journal de la Societe Fran\u00e7aise de Statistique, Societe Fran\u00e7aise de Statistique et Societe Mathematique de France"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00214-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00214-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00214-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T08:04:16Z","timestamp":1688371456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00214-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,30]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00214-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2458482\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,30]]},"assertion":[{"value":"9 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare are no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"30"}}