{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:39Z","timestamp":1725558999026},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_31","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"281-290","source":"Crossref","is-referenced-by-count":2,"title":["Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length"],"prefix":"10.1007","author":[{"given":"H\u00e9ctor","family":"Sanvicente\u2013S\u00e1nchez","sequence":"first","affiliation":[]},{"given":"Juan","family":"Frausto\u2013Sol\u00eds","sequence":"additional","affiliation":[]},{"given":"Froil\u00e1n","family":"Imperial\u2013Valenzuela","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Kann, V.: How to find the best approximation results a follow\u2013up to garey and johnson. ACM SIGACT, News, 9097 (1998)","DOI":"10.1145\/306198.306210"},{"key":"31_CR2","unstructured":"Sanvicente-S\u00e1nchez, H.: Metodolog\u00eda de paralelizaci\u00f3n del ciclo de temperaturas en algoritmos tipo recocido simulado. PhD thesis, ITESM Campus Cuernavaca, M\u00c9XICO (2003)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"4598","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a04598, 671\u2013680 (1983), 220, 4598","journal-title":"Science"},{"key":"31_CR4","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":"31_CR5","doi-asserted-by":"crossref","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 161\u2013175 (1990)","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Computational Science and its Applications\u2013ICCSA 2004","author":"H. Sanvicente-S\u00e1nchez","year":"2004","unstructured":"Sanvicente-S\u00e1nchez, H., Frausto-Sol\u00eds, J.: Method to Establish the Cooling Scheme in Simulated Anneling Like Algorithms. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.K., Gervasi, O. (eds.) Computational Science and its Applications\u2013ICCSA 2004. LNCS. Springer, Heidelberg (2004)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Munakata, T., Nakamura, Y.: Temperature control for simulated annealing. The American Physical Society, Physical Review E\u00a064 (2001)","DOI":"10.1103\/PhysRevE.64.046127"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-24767-8_41","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"M.M. Atiqullah","year":"2004","unstructured":"Atiqullah, M.M.: An efficient simple cooling scheme for simulated annealing. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 396\u2013404. Springer, Heidelberg (2004)"},{"key":"31_CR9","unstructured":"Miki, M., Hiroyasu, T., Ono, K.: Simulated annealing with advanced adaptive neighborhood. In: Second international workshop on Intelligent systems design and application, pp. 113\u2013118. Dynamic Publishers, Inc. (2002)"},{"key":"31_CR10","unstructured":"Miki, M., Hiroyasu, T., Kasai, M., Ono, K., Jitta, T.: Temperature parallel simulated annealing with adaptive neighborhood for continuous optimization problem. In: Second international workshop on Intelligent systems design and application, pp. 149\u2013154. Dynamic Publishers, Inc. (2002)"},{"key":"31_CR11","volume-title":"Metaheuristics: The State of the Art 1995. Proceedings of Metaheuristics International Conference 1995","author":"M. Fleischer","year":"1995","unstructured":"Fleischer, M., Jacobson, S.H.: Cybernetic optimization by simulated annealing: an implementation of parallel processing using probabilistic feedback control. In: Kelly, J. (ed.) Metaheuristics: The State of the Art 1995. Proceedings of Metaheuristics International Conference 1995, Kluwer Academic, Dordrecht (1995)"},{"key":"31_CR12","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":"31_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Longman, Amsterdam (1995)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Gu, J.: Multispace search for satisfiability and np-hard problems. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Satisfiability Problem: Theory and Applications: Proceedings of a DIMACS Workshop, vol.\u00a035, pp. 407\u2013517 (1996)","DOI":"10.1090\/dimacs\/035\/12"},{"key":"31_CR15","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":"31_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M.G. Davis","year":"1960","unstructured":"Davis, M.G., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"31_CR18","unstructured":"Spears, W.M.: Simulated annealing for hard satisfiability problems. Technical report, Naval Research Laboratory, Washington D.C (1993)"},{"key":"31_CR19","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: AAAI 1994: Proceedings of the twelfth national conference on Artificial intelligence, American Association for Artificial Intelligence, vol.\u00a01, pp. 337\u2013343 (1994)"},{"key":"31_CR20","unstructured":"Hirsch, E., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (2001) PDMI preprint 9\/2001, Steklov Institute of Mathematics at St.Petersburg (2001)"},{"key":"31_CR21","unstructured":"Mitchell, D.G., Selman, B., Levesque, H.: Hard and easy distributions of sat problems. In: Proceedings of AAAI 1992, pp. 459\u2013465 (1992)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: A survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"key":"31_CR23","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An Online Resource for Research on SAT (2000)"},{"key":"31_CR24","unstructured":"Consulting date (December 1, 2004), \n                    \n                      http:\/\/www.satlib.org"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:13:42Z","timestamp":1558296822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11496199_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}