{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:30Z","timestamp":1725557910902},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_20","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"216-227","source":"Crossref","is-referenced-by-count":0,"title":["A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"Angluin, D., Valiant, L.G.: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. System. Sci.\u00a018(2), 155\u2013193 (1979)","journal-title":"J. Comput. System. Sci."},{"key":"20_CR2","volume-title":"The Traveling Salesman Problem. A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"20_CR3","volume-title":"Digraphs: Theory, Algorithms and Applications, ch. 5","author":"J. Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, ch. 5. Springer, London (2008), \n                  \n                    http:\/\/www.cs.rhul.ac.uk\/books\/dbook\/"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02579321","volume":"7","author":"B. Bollob\u00e1s","year":"1987","unstructured":"Bollob\u00e1s, B., Fenner, T.I., Frieze, A.M.: An Algorithm for Finding Hamiltonian Paths and Cycles in Random Graphs. Combinatorica\u00a07(4), 327\u2013341 (1987)","journal-title":"Combinatorica"},{"key":"20_CR5","volume-title":"Graph Theory \u2013 An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"Christofides, N.: Graph Theory \u2013 An Algorithmic Approach. Academic Press, New York (1975)"},{"key":"20_CR6","volume-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ch. 11","author":"V. Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal, V.: Hamiltonian Cycles. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ch. 11. John Wiley & Sons, Chichester (1985)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-Solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0095-8956(88)90089-5","volume":"44","author":"A.M. Frieze","year":"1988","unstructured":"Frieze, A.M.: Finding Hamiltonian Cycles in Sparse Random Graphs. J. Combin. Theory Ser. B\u00a044, 230\u2013250 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0196-6774(88)90037-5","volume":"9","author":"A.M. Frieze","year":"1988","unstructured":"Frieze, A.M.: An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. J. Algorithms\u00a09, 181\u2013204 (1988)","journal-title":"J. Algorithms"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/rsa.3240030303","volume":"9","author":"A.M. Frieze","year":"1992","unstructured":"Frieze, A.M., Suen, S.: Counting Hamilton cycles in random directed graphs. Random Structures Algorithms\u00a09, 235\u2013242 (1992)","journal-title":"Random Structures Algorithms"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction Heuristics for the Asymmetric TSP. European J. Oper. Res.\u00a0129, 555\u2013568 (2001)","journal-title":"European J. Oper. Res."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11922377_8","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"B. Goldengorin","year":"2006","unstructured":"Goldengorin, B., J\u00e4ger, G., Molitor, P.: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol.\u00a04235, pp. 86\u201397. Springer, Heidelberg (2006)"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"R.J. Gould","year":"1991","unstructured":"Gould, R.J.: Updating the Hamiltonian Problem \u2013 a Survey. J. Graph Theory\u00a015(2), 121\u2013157 (1991)","journal-title":"J. Graph Theory"},{"key":"20_CR14","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian Circuit by Querying the Graph: Application to DNA Physical Mapping. IR 96-R-123, Centre de Recherche en Informatique de Nancy (1996)"},{"key":"20_CR15","unstructured":"Henderson, R., Apodaca, E.: A Knight of Egodeth: Zen Raptured Quietude. Book Surge Publishing (2008)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","first-page":"287","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Jin","year":"2005","unstructured":"Jin, H., Han, H., Somenzi, F.: Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 287\u2013300. Springer, Heidelberg (2005)"},{"key":"20_CR17","volume-title":"The Traveling Salesman Problem and Its Variations, ch. 10","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: Experimental Analysis of Heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch. 10. Kluwer, Dordrecht (2002)"},{"issue":"4","key":"20_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R. Jonker","year":"1983","unstructured":"Jonker, R., Volgenant, A.: Transforming Asymmetric into Symmetric Traveling Salesman Problems. Oper. Res. Lett.\u00a02(4), 161\u2013163 (1983)","journal-title":"Oper. Res. Lett."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing\u00a038, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"20_CR21","volume-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ch. 6","author":"R.M. Karp","year":"1985","unstructured":"Karp, R.M., Steele, J.M.: Probabilistic Analysis of Heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ch. 6. John Wiley & Sons, Chicester (1985)"},{"key":"20_CR22","unstructured":"Kelly, L.: Hamilton Cycles in Directed Graphs. PhD Thesis, University of Birmingham, United Kingdom (2007)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"M. Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s, M., Szemer\u00e9di, E.: Limit Distribution for the Existence of a Hamiltonian Cycle in a Random Graph. Discrete Math.\u00a043, 55\u201363 (1983)","journal-title":"Discrete Math."},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(96)00031-5","volume":"74","author":"O. Kyek","year":"1997","unstructured":"Kyek, O., Parberry, I., Wegener, I.: Bounds on the Number of Knight\u2019s Tours. Discrete Appl. Math.\u00a074(2), 171\u2013181 (1997)","journal-title":"Discrete Appl. Math."},{"key":"20_CR25","volume-title":"Proc.\u00a021st National Conference on Artificial Intelligence (AAAI)","author":"I. Lynce","year":"2006","unstructured":"Lynce, I., Marques-Silva, J.: Efficient Haplotype Inference with Boolean Satisfiability. In: Proc.\u00a021st National Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park (2006)"},{"issue":"1","key":"20_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/356022.356030","volume":"9","author":"S. Martello","year":"1983","unstructured":"Martello, S.: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph. ACM Trans. Math. Software\u00a09(1), 131\u2013138 (1983)","journal-title":"ACM Trans. Math. Software"},{"key":"20_CR27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0120903","volume":"13","author":"C.J.H. McDiarmid","year":"1980","unstructured":"McDiarmid, C.J.H.: Cluster Percolation and Random Graphs. Math. Program. Stud.\u00a013, 17\u201325 (1980)","journal-title":"Math. Program. Stud."},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L. P\u00f3sa","year":"1976","unstructured":"P\u00f3sa, L.: Hamiltonian Circuits in Random Graphs. Discrete Math.\u00a014, 359\u2013364 (1976)","journal-title":"Discrete Math."},{"issue":"1-2","key":"20_CR29","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1002\/rsa.20059","volume":"26","author":"M. Stojakovi\u0107","year":"2005","unstructured":"Stojakovi\u0107, M., Szab\u00f3, T.: Positional Games on Random Graphs. Random Structures Algorithms\u00a026(1-2), 204\u2013223 (2005)","journal-title":"Random Structures Algorithms"},{"key":"20_CR30","unstructured":"Vandegriend, B.: Finding Hamiltonian Cycles: Algorithms, Graphs and Performance. Master Thesis, University of Alberta, Canada (1998)"},{"key":"20_CR31","unstructured":"8th DIMACS Implementation Challenge: The Traveling Salesman Problem, \n                  \n                    http:\/\/www.research.att.com\/~dsj\/chtsp\/"},{"key":"20_CR32","unstructured":"The Hamiltonian Page by Gutin, G., Moscato, P.: \n                  \n                    http:\/\/www.ing.unlp.edu.ar\/cetad\/mos\/Hamilton.html"},{"key":"20_CR33","unstructured":"The Stony Brook Algorithm Repository by Skiena, S.: \n                  \n                    http:\/\/www.cs.sunysb.edu\/~algorith\/files\/hamiltonian-cycle.shtml"},{"key":"20_CR34","unstructured":"Source code of [2](Concorde), \n                  \n                    http:\/\/www.tsp.gatech.edu\/concorde.html"},{"key":"20_CR35","unstructured":"Source code of [7] (MiniSat), \n                  \n                    http:\/\/minisat.se"},{"key":"20_CR36","unstructured":"Source code of [19], \n                  \n                    http:\/\/www.magiclogic.com\/assignment.html"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:57:03Z","timestamp":1619783823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}