{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T23:54:39Z","timestamp":1764201279195},"reference-count":0,"publisher":"International Academy Publishing (IAP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"published-print":{"date-parts":[[2019]]},"DOI":"10.17706\/jcp.14.6.426-437","type":"journal-article","created":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T07:38:03Z","timestamp":1595489883000},"page":"426-437","source":"Crossref","is-referenced-by-count":2,"title":["A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph"],"prefix":"10.17706","volume":"14","author":[{"given":"Yong","family":"Wang","sequence":"first","affiliation":[]}],"member":"7163","published-online":{"date-parts":[[2019]]},"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T07:38:08Z","timestamp":1595489888000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jcomputers.us\/index.php?m=content&c=index&a=show&catid=212&id=2952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":0,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019]]},"published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.17706\/jcp.14.6.426-437","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2019]]}}}