{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:14:21Z","timestamp":1648944861999},"reference-count":0,"publisher":"Inderscience Publishers","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJCSM"],"published-print":{"date-parts":[[2015]]},"DOI":"10.1504\/ijcsm.2015.067544","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T13:00:40Z","timestamp":1424437240000},"page":"69","source":"Crossref","is-referenced-by-count":0,"title":["A memetic algorithm for the max-cut problem"],"prefix":"10.1504","volume":"6","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"378","container-title":["International Journal of Computing Science and Mathematics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T13:00:48Z","timestamp":1424437248000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=67544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1504\/ijcsm.2015.067544","relation":{},"ISSN":["1752-5055","1752-5063"],"issn-type":[{"value":"1752-5055","type":"print"},{"value":"1752-5063","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}