{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:20Z","timestamp":1725663080974},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540065838"},{"type":"electronic","value":"9783540379034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1973]]},"DOI":"10.1007\/3-540-06583-0_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:25:47Z","timestamp":1330183547000},"page":"554-565","source":"Crossref","is-referenced-by-count":0,"title":["Attempt to solve a combinatorial problem in the continuum by a method of extension-reduction"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Spedicato","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Tagliabue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. A. Nelder","year":"1965","unstructured":"Nelder, J. A. and Nead, R.: A simplex method for function minimization, Comput. J., 7, 308\u2013313, 1965","journal-title":"Comput. J."},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"M. J. D. D. Powell","year":"1964","unstructured":"Powell, M. J. D.: An efficient method of finding the minimum of a function of several variables without calculating derivatives, Comput. J., 7, 155\u2013162, 1964","journal-title":"Comput. J."},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R. Fletcher","year":"1964","unstructured":"Fletcher, R. and Reeves, C. M.: Function minimization by conjugate gradients, Computer J., 7, 149\u2013154, 1964","journal-title":"Computer J."},{"doi-asserted-by":"crossref","unstructured":"Polak, E. and Ribiere, G.: Note sur le convergence de methodes des directions conjugees, University of California, Berkeley, Dept. of Electrical Engineering and Computer Sciences, working paper, 1969","key":"54_CR4","DOI":"10.1051\/m2an\/196903R100351"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/0016-0032(69)90253-1","volume":"288","author":"H. W. Sorenson","year":"1969","unstructured":"Sorenson, H. W.: Conjugate Direction Procedures for Function Minimization, Journal of the Franklin Institute, 288, 421\u2013441, 1969","journal-title":"Journal of the Franklin Institute"},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"2286","DOI":"10.2514\/3.6507","volume":"9","author":"I. Fried","year":"1971","unstructured":"Fried, I.: N-step Conjugate Gradient Minimization Scheme for Nonquadratic Functions, AIAA Journal, 9, 2286\u20132287, 1971","journal-title":"AIAA Journal"},{"unstructured":"Spedicato, E.: Un polialgoritmo per la minimizzazione di una funzione di pi\u00f9 variabili, Atti del Convegno AICA su Tecniche di Simulazione e Algoritmi, Milano, Informatica, Numero speciale, 1972","key":"54_CR7"},{"key":"54_CR8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/362705.362714","volume":"13","author":"K. Fielding","year":"1970","unstructured":"Fielding, K.: Function minimization and linear search, Algorithm 387, Commun. of ACM, 13, 8, 1970","journal-title":"Commun. of ACM"},{"unstructured":"Spedicato, E.: Un polialgoritmo a gradiente coniuga to per la minimizzazione di funzioni nonlineari in molte variabili, Nota tecnica CISE-73.012, Milano, 1973","key":"54_CR9"},{"unstructured":"Spedicato, E.: CISE-Report to appear","key":"54_CR10"},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. L. Lawler","year":"1963","unstructured":"Lawler, E. L.: The Quadratic Assignement Problem, Management Sci, 9, 586\u2013599, 1963","journal-title":"Management Sci"},{"key":"54_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.9.2.294","volume":"9","author":"G. C. Armour","year":"1963","unstructured":"Armour, G. C. and Buffa, E. S.: A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities, Management Sci., 9, 294\u2013309, 1963","journal-title":"Management Sci."},{"key":"54_CR13","first-page":"305","volume":"10","author":"P. C. Gilmore","year":"1962","unstructured":"Gilmore, P. C.: Optimal and Suboptimal Algorithms for the Quadratic Assignement, SIAM J., 10, 305\u2013313, 1962","journal-title":"SIAM J."},{"key":"54_CR14","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/mnsc.13.1.42","volume":"13","author":"F. S. Hillier","year":"1966","unstructured":"Hillier, F. S. and Connors, M. M.: Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities, Management Sci., 13, 42\u201357, 1966","journal-title":"Management Sci."},{"key":"54_CR15","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.16.7.453","volume":"16","author":"G. W. Graves","year":"1970","unstructured":"Graves, G. W. and Whinston, A. B.: An Algorithm for the Quadratic Assignment Problem, Management Sci., 16, 453\u2013471, 1970","journal-title":"Management Sci."},{"unstructured":"Casanova, M. and Tagliabue, G.: CISE-Report to appear","key":"54_CR16"},{"unstructured":"Hansen, P.: Quadratic Zerc-One Programming by Implicit Enumeration, in Numerical Methods for non-linear Optimization, (F.A. Lootsma, ed.), Academic Press, 1972","key":"54_CR17"},{"unstructured":"Miele, A., Coggins, G. M. and Levy, A. V.: Updating rules for the penalty constant used in the penalty function method for mathematic programming problems, Aero-Astronautics Report n. 90, Rice University, Houston, 1972","key":"54_CR18"},{"unstructured":"Powell, M. J. D.: A Method for Nonlinear Constraints in Minimization Problems in Optimization, (R. Fletcher, ed.), Academic Press, 1969","key":"54_CR19"},{"key":"54_CR20","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C. E. Nugent","year":"1968","unstructured":"Nugent, C. E., Vollmann, T. E. and Ruml J.: An experimental comparison of techniques for the assignment of facilities to locations, Operations Research, 16, 150\u2013173, 1968.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","5th Conference on Optimization Techniques Part I"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-06583-0_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:37Z","timestamp":1605642937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-06583-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973]]},"ISBN":["9783540065838","9783540379034"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-06583-0_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1973]]}}}