{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T05:37:05Z","timestamp":1675229825209},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T00:00:00Z","timestamp":1202860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10878-008-9140-6","type":"journal-article","created":{"date-parts":[[2008,2,12]],"date-time":"2008-02-12T17:57:50Z","timestamp":1202839070000},"page":"99-123","source":"Crossref","is-referenced-by-count":7,"title":["Graph coloring by multiagent fusion search"],"prefix":"10.1007","volume":"18","author":[{"given":"Xiao-Feng","family":"Xie","sequence":"first","affiliation":[]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,13]]},"reference":[{"issue":"3","key":"9140_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1207\/s15516709cog0000_22","volume":"29","author":"JR Anderson","year":"2005","unstructured":"Anderson JR (2005) Human symbol manipulation within an integrated cognitive architecture. Cogn Sci 29(3):313\u2013341","journal-title":"Cogn Sci"},{"key":"9140_CR2","volume-title":"Social learning theory","author":"A Bandura","year":"1977","unstructured":"Bandura A (1977) Social learning theory. Prentice Hall, Englewood Cliffs"},{"issue":"1","key":"9140_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/B:JOCO.0000021937.26468.b2","volume":"8","author":"VC Barbosa","year":"2004","unstructured":"Barbosa VC, Assis CAG, do Nascimento JO (2004) Two novel evolutionary formulations of the graph coloring problem. J Comb Optim 8(1):41\u201363","journal-title":"J Comb Optim"},{"issue":"1\u20134","key":"9140_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier N, Brisset P (2004) Graph coloring for air traffic flow management. Ann Oper Res 130(1\u20134):163\u2013178","journal-title":"Ann Oper Res"},{"key":"9140_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese KD, Kahng AB, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimizations. Oper Res Lett 16:101\u2013113","journal-title":"Oper Res Lett"},{"issue":"6","key":"9140_CR6","doi-asserted-by":"crossref","first-page":"066703","DOI":"10.1103\/PhysRevE.69.066703","volume":"69","author":"S Boettcher","year":"2004","unstructured":"Boettcher S, Percus AG (2004) Extremal optimization at the phase transition of the three-coloring problem. Phys Rev E 69(6):Art066703","journal-title":"Phys Rev E"},{"key":"9140_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, London"},{"issue":"4","key":"9140_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251\u2013256","journal-title":"Commun ACM"},{"issue":"2","key":"9140_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.dam.2006.07.012","volume":"156","author":"TN Bui","year":"2008","unstructured":"Bui TN, Nguyen TH, Patel CM, Phan K-AT (2008) An ant-based algorithm for coloring graphs. Discrete Appl Math 156(2):190\u2013200","journal-title":"Discrete Appl Math"},{"key":"9140_CR10","unstructured":"Cheeseman P, Kanefsky B, Taylor WM (1991) Where the really hard problems are. In: International joint conference on artificial intelligence, San Mateo, CA, pp 331\u2013337"},{"key":"9140_CR11","unstructured":"Chiarandini M (2005) Stochastic local search methods for highly constrained combinatorial optimisation problems. PhD thesis, Darmstadt University of Technology, Germany"},{"issue":"3","key":"9140_CR12","doi-asserted-by":"crossref","first-page":"7314","DOI":"10.1073\/pnas.082081499","volume":"99","author":"C Cioffi-Revilla","year":"2002","unstructured":"Cioffi-Revilla C (2002) Invariance and universality in social agent-based simulations. Proc Natl Acad Sci USA 99(3):7314\u20137316","journal-title":"Proc Natl Acad Sci USA"},{"key":"9140_CR13","unstructured":"Coudert O (1997) Exact coloring of real-life graphs is easy. In: Design automation conference, San Francisco, CA, USA, pp 121\u2013126"},{"key":"9140_CR14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1090\/dimacs\/026\/13","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","author":"JC Culberson","year":"1996","unstructured":"Culberson JC, Luo F (1996) Exploring the k-colorable landscape with iterated greedy. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 245\u2013284"},{"issue":"4","key":"9140_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1177\/1059712306072335","volume":"14","author":"D Curran","year":"2006","unstructured":"Curran D, O\u2019Riordan C (2006) Increasing population diversity through cultural learning. Adapt Behav 14(4):315\u2013338","journal-title":"Adapt Behav"},{"issue":"1","key":"9140_CR16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10878-006-9036-2","volume":"14","author":"V Cutello","year":"2007","unstructured":"Cutello V, Nicosia G, Pavone M (2007) An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. J Comb Optim 14(1):9\u201333","journal-title":"J Comb Optim"},{"issue":"1","key":"9140_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/72.977273","volume":"13","author":"A Di Blas","year":"2002","unstructured":"Di Blas A, Jagota A, Hughey R (2002) Energy function-based approaches to graph coloring. IEEE Trans Neural Netw 13(1):81\u201391","journal-title":"IEEE Trans Neural Netw"},{"key":"9140_CR18","first-page":"287","volume":"1","author":"TG Dietterich","year":"1986","unstructured":"Dietterich TG (1986) Learning at the knowledge level. Mach Learn 1:287\u2013316","journal-title":"Mach Learn"},{"key":"9140_CR19","doi-asserted-by":"crossref","unstructured":"Dorne R, Hao JK (1998) A new genetic local search algorithm for graph coloring. In: International conference on parallel problem solving from nature, Amsterdam, NL, pp 745\u2013754","DOI":"10.1007\/BFb0056916"},{"issue":"11","key":"9140_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/1029496.1029499","volume":"47","author":"T Edgington","year":"2004","unstructured":"Edgington T, Choi B, Henson K, Raghu TS, Vinze A (2004) Adopting ontology to facilitate knowledge sharing. Commun ACM 47(11):85\u201390","journal-title":"Commun ACM"},{"issue":"2","key":"9140_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D Eppstein","year":"2003","unstructured":"Eppstein D (2003) Small maximal independent sets and faster exact graph coloring. J Graph Algorithms Appl 7(2):131\u2013140","journal-title":"J Graph Algorithms Appl"},{"key":"9140_CR22","unstructured":"Erben W (2000) Grouping genetic algorithm for graph colouring and exam timetabling. In: International conference on practice and theory of automated timetabling, Konstanz, Germany, pp 132\u2013156"},{"issue":"1","key":"9140_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5\u201330","journal-title":"J Heuristics"},{"key":"9140_CR24","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63:437\u2013464","journal-title":"Ann Oper Res"},{"issue":"1","key":"9140_CR25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.3758\/BF03196004","volume":"32","author":"D Fragaszy","year":"2004","unstructured":"Fragaszy D, Visalberghi E (2004) Socially biased learning in monkeys. Learn Behav 32(1):24\u201335","journal-title":"Learn Behav"},{"key":"9140_CR26","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1613\/jair.445","volume":"7","author":"J Frank","year":"1997","unstructured":"Frank J, Cheeseman P, Stutz J (1997) When gravity fails: local search topology. J Artif Intell Res 7:249\u2013281","journal-title":"J Artif Intell Res"},{"issue":"7","key":"9140_CR27","first-page":"1420","volume":"83","author":"N Funabiki","year":"2000","unstructured":"Funabiki N, Higashino T (2000) A minimal-state processing search algorithm for graph coloring problems. IEICE Trans Fundam Electron Commun Comput Sci E 83A(7):1420\u20131430","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci E"},{"issue":"5","key":"9140_CR28","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1006\/anbe.1995.0164","volume":"49","author":"BG Galef","year":"1995","unstructured":"Galef BG (1995) Why behaviour patterns that animals learn socially are locally adaptive. Anim Behav 49(5):1325\u20131334","journal-title":"Anim Behav"},{"issue":"4","key":"9140_CR29","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379\u2013397","journal-title":"J Comb Optim"},{"issue":"9","key":"9140_CR30","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33(9):2547\u20132562","journal-title":"Comput Oper Res"},{"issue":"2","key":"9140_CR31","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier P, Hertz A, Zufferey N (2008) An adaptive memory algorithm for the k-colouring problem. Discrete Appl Math 156(2):267\u2013279","journal-title":"Discrete Appl Math"},{"issue":"4","key":"9140_CR32","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"AH Gebremedhin","year":"2005","unstructured":"Gebremedhin AH, Manne F, Pothen A (2005) What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev 47(4):629\u2013705","journal-title":"SIAM Rev"},{"issue":"4","key":"9140_CR33","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1037\/0033-295X.103.4.650","volume":"103","author":"G Gigerenzer","year":"1996","unstructured":"Gigerenzer G, Goldstein DG (1996) Reasoning the fast and frugal way: models of bounded rationality. Psych Rev 103(4):650\u2013669","journal-title":"Psych Rev"},{"issue":"3","key":"9140_CR34","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1027312403532","volume":"7","author":"CA Glass","year":"2003","unstructured":"Glass CA, Prugel-Bennett A (2003) Genetic algorithm for graph coloring: exploration of Galinier and Hao\u2019s algorithm. J Comb Optim 7(3):229\u2013236","journal-title":"J Comb Optim"},{"issue":"1","key":"9140_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0140525X97000010","volume":"20","author":"AM Glenberg","year":"1997","unstructured":"Glenberg AM (1997) What memory is for. Behav Brain Sci 20(1):1\u201355","journal-title":"Behav Brain Sci"},{"issue":"1\u20132","key":"9140_CR36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes CP, Selman B (2001) Algorithm portfolios. Artif Intell 126(1\u20132):43\u201362","journal-title":"Artif Intell"},{"key":"9140_CR37","unstructured":"Hamiez J-P, Hao J-K (2001) Scatter search for graph coloring. In: International conference on artificial evolution, Le Creusot, France, pp 168\u2013179"},{"key":"9140_CR38","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345\u2013351","journal-title":"Computing"},{"key":"9140_CR39","unstructured":"Hoos HH (1999) On the run-time behaviour of stochastic local search algorithms for SAT. In: National conference on artificial intelligence, Orlando, FL, pp 661\u2013666"},{"key":"9140_CR40","unstructured":"Hoos HH, St\u00fctzle T (1998) Evaluating Las Vegas algorithms\u2014pitfalls and remedies. In: Conference on uncertainty in artificial intelligence, Madison, WI, pp 238\u2013245"},{"issue":"3","key":"9140_CR41","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39(3):378\u2013406","journal-title":"Oper Res"},{"key":"9140_CR42","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","year":"1996","unstructured":"Johnson DS, Trick MA (eds) (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence"},{"key":"9140_CR43","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"DE Joslin","year":"1999","unstructured":"Joslin DE, Clements DP (1999) \u201cSqueaky wheel\u201d optimization. J Artif Intell Res 10:353\u2013373","journal-title":"J Artif Intell Res"},{"issue":"3","key":"9140_CR44","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s004930070013","volume":"20","author":"S Khanna","year":"2000","unstructured":"Khanna S, Linial N, Safra S (2000) On the hardness of approximating the chromatic number. Combinatorica 20(3):393\u2013415","journal-title":"Combinatorica"},{"key":"9140_CR45","doi-asserted-by":"crossref","unstructured":"Kirovski D (1998) Efficient coloring of a large spectrum of graphs. In: Design automation conference, San Francisco, CA, USA, pp 427\u2013432","DOI":"10.1145\/277044.277165"},{"key":"9140_CR46","doi-asserted-by":"crossref","unstructured":"Lerman K, Galstyan A (2003) Agent memory and adaptation in multi-agent systems. In: International conference on autonomous agents and multi-agent systems, Melbourne, Australia, pp 797\u2013803","DOI":"10.1145\/860575.860703"},{"issue":"1","key":"9140_CR47","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0004-3702(01)00174-6","volume":"136","author":"J Liu","year":"2002","unstructured":"Liu J, Han J, Tang YY (2002) Multi-agent oriented constraint satisfaction. Artif Intell 136(1):101\u2013144","journal-title":"Artif Intell"},{"key":"9140_CR48","volume-title":"Autonomy Oriented Computing (AOC): From problem solving to complex systems modeling","author":"J Liu","year":"2005","unstructured":"Liu J, Jin X, Tsui K-C (2005) Autonomy Oriented Computing (AOC): From problem solving to complex systems modeling. Kluwer Academic, Dordrecht"},{"issue":"10","key":"9140_CR49","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/1164394.1164395","volume":"49","author":"J Liu","year":"2006","unstructured":"Liu J, Tsui K-C (2006) Toward nature-inspired computing. Commun ACM 49(10):59\u201364","journal-title":"Commun ACM"},{"issue":"4","key":"9140_CR50","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra A, Trick M (1996) A column generation approach for graph coloring. INFORMS J Comput 8(4):344\u2013354","journal-title":"INFORMS J Comput"},{"issue":"4","key":"9140_CR51","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"20","key":"9140_CR52","doi-asserted-by":"crossref","first-page":"200202","DOI":"10.1103\/PhysRevLett.95.200202","volume":"95","author":"M Mezard","year":"2005","unstructured":"Mezard M, Palassini M, Rivoire O (2005) Landscape of solutions in constraint satisfaction problems. Phys Rev Lett 95(20):Art200202","journal-title":"Phys Rev Lett"},{"key":"9140_CR53","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1090\/dimacs\/026\/16","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","author":"C Morgenstern","year":"1996","unstructured":"Morgenstern C (1996) Distributed coloration neighborhood search. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 335\u2013358"},{"key":"9140_CR54","doi-asserted-by":"crossref","unstructured":"Mumford CL (2006) New order-based crossovers for the graph coloring problem. In: International conference on parallel problem solving from nature, Reykjavik, Iceland, pp 880\u2013889","DOI":"10.1007\/11844297_89"},{"key":"9140_CR55","volume-title":"Human problem solving","author":"A Newell","year":"1972","unstructured":"Newell A, Simon HA (1972) Human problem solving. Prentice-Hall, Englewood Cliffs"},{"key":"9140_CR56","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki E (1996) A fast tabu search algorithm for the permutation flow shop problem. Eur J Oper Res 91:160\u2013175","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9140_CR57","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves CR, Yamada T (1998) Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol Comput 6(1):45\u201360","journal-title":"Evol Comput"},{"issue":"1","key":"9140_CR58","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S0036144501395952","volume":"44","author":"CM Reidys","year":"2002","unstructured":"Reidys CM, Stadler PF (2002) Combinatorial landscapes. SIAM Rev 44(1):3\u201354","journal-title":"SIAM Rev"},{"issue":"2","key":"9140_CR59","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D Schuurmans","year":"2001","unstructured":"Schuurmans D, Southey F (2001) Local search characteristics of incomplete SAT procedures. Artif Intell 132(2):121\u2013150","journal-title":"Artif Intell"},{"key":"9140_CR60","unstructured":"Selman B, Kautz HA (1993) An empirical study of greedy local search for satisfiability testing. In: National conference on artificial intelligence, Washington, DC, USA, pp 46\u201351"},{"key":"9140_CR61","unstructured":"Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search. In: National conference on artificial intelligence, Seattle, WA, pp 337\u2013343"},{"issue":"6","key":"9140_CR62","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/996893.996875","volume":"39","author":"MD Smith","year":"2004","unstructured":"Smith MD, Ramsey N, Holloway G (2004) A generalized algorithm for graph-coloring register allocation. ACM SIGPLAN Not 39(6):277\u2013288","journal-title":"ACM SIGPLAN Not"},{"issue":"3","key":"9140_CR63","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1008942012299","volume":"8","author":"P Stone","year":"2000","unstructured":"Stone P, Veloso M (2000) Multiagent systems: a survey from a machine learning perspective. Auton Robots 8(3):345\u2013383","journal-title":"Auton Robots"},{"key":"9140_CR64","doi-asserted-by":"crossref","unstructured":"Trick MA, Yildiz H (2007) A large neighborhood search heuristic for graph coloring. In: International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Brussels, Belgium, pp 346\u2013360","DOI":"10.1007\/978-3-540-72397-4_25"},{"key":"9140_CR65","unstructured":"Walsh T (2001) Search on high degree graphs. In: International joint conference on artificial intelligence, Seattle, Washington, USA, pp 266\u2013274"},{"key":"9140_CR66","first-page":"409","volume":"29","author":"D Weyns","year":"2005","unstructured":"Weyns D, Holvoet T (2005) On the role of environments in multiagent systems. Informatica 29:409\u2013421","journal-title":"Informatica"},{"key":"9140_CR67","unstructured":"Xie X-F, Liu J (2005) A compact multiagent system based on autonomy oriented computing. In: IEEE\/WIC\/ACM international conference on intelligent agent technology, Compi\u00e8gne, France, pp\u00a038\u201344"},{"key":"9140_CR68","unstructured":"Xie X-F, Liu J (2006) How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. In: International joint conference on autonomous agents and multiagent systems, Hakodate, Japan, pp 646\u2013653"},{"key":"9140_CR69","doi-asserted-by":"crossref","unstructured":"Xie X-F, Zhang W-J (2004) SWAF: swarm algorithm framework for numerical optimization. In: Genetic and evolutionary computation conference, Seattle, WA, pp 238\u2013250","DOI":"10.1007\/978-3-540-24854-5_21"},{"issue":"1","key":"9140_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","volume":"158","author":"W Zhang","year":"2004","unstructured":"Zhang W (2004) Configuration landscape analysis and backbone guided local search. Artif Intell 158(1):1\u201326","journal-title":"Artif Intell"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9140-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9140-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9140-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T05:23:39Z","timestamp":1630733019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9140-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,13]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9140"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9140-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,13]]}}}