{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:04:30Z","timestamp":1768349070666,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10288-020-00431-4","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T14:03:17Z","timestamp":1582120997000},"page":"507-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tackling the maximum happy vertices problem in large networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Kerri","family":"Morgan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"431_CR1","unstructured":"Agrawal A, (2018) On the parameterized complexity of happy vertex coloring. In: Brankovic L, Ryan J, Smyth W (eds) Combinatorial algorithms. IWOCA, (2017) Lecture notes in computer science, vol 10765. Springer, Cham, pp 103\u2013115"},{"key":"431_CR2","first-page":"281","volume-title":"Combinatorial algorithms. IWOCA 2016. Lecture notes in computer science","author":"N Aravind","year":"2016","unstructured":"Aravind N, Kalyanasundaram S, Kare A (2016) Linear time algorithms for happy vertex coloring problems for trees. In: M\u00e4kinen V, Puglisi S, Salmela L (eds) Combinatorial algorithms. IWOCA 2016. Lecture notes in computer science, vol 9843. Springer, Cham, pp 281\u2013292"},{"key":"431_CR3","volume-title":"Network science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si AL, P\u00f5sfai M (2016) Network science. Cambridge University Press, Cambridge"},{"issue":"3","key":"431_CR4","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger I, Zufferey N (2008) A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research 35(3):960\u2013975 (Part Special Issue: New Trends in Locational Analysis)","journal-title":"Computers & Operations Research"},{"key":"431_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268\u2013308","journal-title":"ACM Comput Surv"},{"issue":"3","key":"431_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"MW Carter","year":"1996","unstructured":"Carter MW, Laporte G, Lee SY (1996) Examination timetabling: algorithmic strategies and applications. J Oper Res Soc 47(3):373\u2013383","journal-title":"J Oper Res Soc"},{"key":"431_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and theory of automated timetabling III","author":"L Di Gaspero","year":"2001","unstructured":"Di Gaspero L, Schaerf A (2001) Tabu search techniques for examination timetabling. In: Burke E, Erben W (eds) Practice and theory of automated timetabling III. Springer, Berlin, pp 104\u2013117"},{"key":"431_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9780470977811","volume-title":"Cluster analysis","author":"B Everitt","year":"2011","unstructured":"Everitt B, Landau S, Leese M, Stahl D (2011) Cluster analysis. Wiley, Hoboken"},{"key":"431_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Norwell"},{"key":"431_CR10","first-page":"2093","volume-title":"Tabu search","author":"F Glover","year":"1999","unstructured":"Glover F, Laguna M (1999) Tabu search. Springer, Boston, pp 2093\u20132229"},{"key":"431_CR11","volume-title":"A guide to graph colouring: algorithms and applications","author":"R Lewis","year":"2015","unstructured":"Lewis R (2015) A guide to graph colouring: algorithms and applications, 1st edn. Springer, Berlin","edition":"1"},{"key":"431_CR12","unstructured":"Lewis R (2020) Tabu search source code. http:\/\/www.rhydlewis.eu\/resources\/happytabu.zip. Accessed 24 Jan 2020"},{"issue":"11","key":"431_CR13","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1057\/jors.2016.34","volume":"67","author":"R Lewis","year":"2016","unstructured":"Lewis R, Carroll F (2016) Creating seating plans: a practical application. J Oper Res Soc 67(11):1353\u20131362","journal-title":"J Oper Res Soc"},{"issue":"3","key":"431_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ejor.2014.07.041","volume":"240","author":"R Lewis","year":"2015","unstructured":"Lewis R, Thompson J (2015) Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. Eur J Oper Res 240(3):637\u2013648","journal-title":"Eur J Oper Res"},{"key":"431_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cor.2018.11.015","volume":"103","author":"R Lewis","year":"2019","unstructured":"Lewis R, Thiruvady D, Morgan K (2019) Finding happiness: an analysis of the maximum happy vertices problem. Comput Oper Res 103:265\u2013276","journal-title":"Comput Oper Res"},{"key":"431_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2015.06.003","volume":"593","author":"A Li","year":"2015","unstructured":"Li A, Zhang P (2015) Algorithmic aspects of homophyly of networks. Theor Comput Sci 593:117\u2013131","journal-title":"Theor Comput Sci"},{"issue":"3","key":"431_CR17","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1016\/j.ejor.2008.03.050","volume":"197","author":"BB Mabrouk","year":"2009","unstructured":"Mabrouk BB, Hasni H, Mahjoub Z (2009) On a parallel genetic-tabu search based algorithm for solving the graph colouring problem. Eur J Oper Res 197(3):1192\u20131201","journal-title":"Eur J Oper Res"},{"issue":"1","key":"431_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum B, Schaerf A, Paechter B, McMullan P, Lewis R, Parkes AJ, Gaspero L, Qu R, Burke EK (2010) Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS J Comput 22(1):120\u2013130","journal-title":"INFORMS J Comput"},{"issue":"5","key":"431_CR19","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1007\/s00453-017-0302-8","volume":"80","author":"P Zhang","year":"2018","unstructured":"Zhang P, Xu Y, Jiang T, Li A, Lin G, Miyano E (2018) Improved approximation algorithms for the maximum happy vertices and edges problems. Algorithmica 80(5):1412\u20131438","journal-title":"Algorithmica"},{"issue":"4","key":"431_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-008-0066-8","volume":"11","author":"N Zufferey","year":"2008","unstructured":"Zufferey N, Amstutz P, Giaccari P (2008) Graph colouring approaches for a satellite range scheduling problem. J Sched 11(4):263\u2013277","journal-title":"J Sched"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00431-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00431-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00431-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T07:35:39Z","timestamp":1613720139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00431-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["431"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00431-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"10 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors guarantee that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research involves no human participants nor animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}