{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:14Z","timestamp":1725512054206},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681229"},{"type":"electronic","value":"9783540681236"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68123-6_24","type":"book-chapter","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T12:11:39Z","timestamp":1210335099000},"page":"215-224","source":"Crossref","is-referenced-by-count":4,"title":["Golden Ratio Annealing for Satisfiability Problems Using Dynamically Cooling Schemes"],"prefix":"10.1007","author":[{"given":"Juan","family":"Frausto-Solis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Martinez-Rios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of 3rd Annual ACM symposium on the Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of 3rd Annual ACM symposium on the Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"key":"24_CR3","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley Longman, Redwood City (1995)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Gu, J.: Multispace search for satisfiability and NP-hard problems. In: Satisfiability Problem: Theory and Applications: Proceedings of a DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, pp. 407\u2013517 (1996)","DOI":"10.1090\/dimacs\/035\/12"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-56992-8_9","volume-title":"Computer Science Logic","author":"N. Creignou","year":"1993","unstructured":"Creignou, N.: The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 115\u2013133. Springer, Heidelberg (1993)"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69","author":"J. Edmons","year":"1965","unstructured":"Edmons, J.: Minimum partition of a matroid into independent subset. J. Res. Nat. Bur. Standards Sect. B\u00a069, 67\u201372 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"24_CR7","first-page":"51","volume-title":"Proc. International Congress of Mathematicians","author":"S. Cook","year":"1991","unstructured":"Cook, S.: Computational Complexity of Higher Type Functions. In: Proc. International Congress of Mathematicians, Kyoto, Japan, pp. 51\u201369. Springer, Heidelberg (1991)"},{"key":"24_CR8","unstructured":"Bertzekas, D.P.: Network Optimization: Continuos and Discrete Models. Athena Scientific (1998)"},{"key":"24_CR9","volume-title":"Non Linear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Non Linear Programming: Theory and Algorithms, 2nd edn. Wiley, Chichester (1993)","edition":"2"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Olivetti the Fianca, F., Von Zuben, F.J., Nunes de Castro, L.: An Artificial Immune Network for Multimodal Function Optimization on Dynamic Environments. In: GECCO 2005, Washington DC, USA, June 25-29 (2005)","DOI":"10.1145\/1068009.1068057"},{"key":"24_CR11","volume-title":"The Golden Ratio: The Story of Phi, The World\u2019s Most Astonishing Number","author":"M. Livio","year":"2002","unstructured":"Livio, M.: The Golden Ratio: The Story of Phi, The World\u2019s Most Astonishing Number. Broadway Books, New York (2002)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Cook, S., Mithchel, D.G.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Satisfibility Problem Theory and Applications. Dimacs Series Discrete Mathematics and Theoretical Computer Sciences, pp. 1\u201317 (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P., Franco, J., Wah, B.: Algorithms for the satisfaibility (SAT) problem: A Survey. In: Satisfibility Problem Theory and Applications. Dimacs Series Discrete Mathematics and Theoretical Computer Sciences, pp. 19\u2013151 (1997)","DOI":"10.1090\/dimacs\/035\/02"},{"key":"24_CR14","unstructured":"Cerny, V.: A Thermodynamical Approach to the Traveling Salesman Problem: An efficient Simulation Algorithm, Report, Comenius University, Bratislava, Czechoslovakia (1982)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications\u00a045, 41\u201351 (1985)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a0(4598) 220, 671\u2013680 (1983)","DOI":"10.1126\/science.220.4598.671"},{"key":"24_CR17","volume-title":"Simulated annealing and Boltzman machines: A stochastic approach to combinatorial optimization and neural computing","author":"E. Aarts","year":"1989","unstructured":"Aarts, E., y Korst, E.: Simulated annealing and Boltzman machines: A stochastic approach to combinatorial optimization and neural computing. John Wiley & Sons, Great Bretain (1989)"},{"key":"24_CR18","volume-title":"ANDYMARK: An analytical Method to Establish Dynamically the Length of the Markov Chian in Simulated Annealing for the Satisfiablity Problem","author":"J. Frausto","year":"2006","unstructured":"Frausto, J., Sanvicente, H., Imperial, F.: ANDYMARK: An analytical Method to Establish Dynamically the Length of the Markov Chian in Simulated Annealing for the Satisfiablity Problem. Springer, Heidelberg (2006)"},{"issue":"11","key":"24_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"L. Ingber","year":"1993","unstructured":"Ingber, L.: Simulated Annealing; Practice Versus Theory. J. MATHL. Comput. Modeling\u00a018(11), 29\u201357 (1993)","journal-title":"J. MATHL. Comput. Modeling"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Mezard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science, June 27 (2002)","DOI":"10.1126\/science.1073287"},{"key":"24_CR21","unstructured":"SATLIB - The Satisfiability Library, http:\/\/www.cs.ubc.ca\/~hoos\/SATLIB\/index-ubc.html"},{"key":"24_CR22","unstructured":"Horie, S., Watanabe, O.: Hard instance generation for SAT, Technical Report TR97-0007, Dept. of Computer Science, Tokyo Inst. of Tech. (Available from CS Dept. TR Archive); the extended abstract appeared in Proc. ISAAC 1997. LNCS, vol. 1350. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68123-6_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:35:45Z","timestamp":1620016545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68123-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681229","9783540681236"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68123-6_24","relation":{},"subject":[]}}