{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:23:59Z","timestamp":1753885439699,"version":"3.41.2"},"reference-count":0,"publisher":"Inderscience Publishers","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJCSE"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1504\/ijcse.2018.10011517","type":"journal-article","created":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T09:00:24Z","timestamp":1520240424000},"page":"191","source":"Crossref","is-referenced-by-count":0,"title":["A based-on-set-partitioning exact approach to multi-trip of picking up and delivering customers to airports"],"prefix":"10.1504","volume":"16","author":[{"given":"Jia","family":"Li","sequence":"first","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"378","container-title":["International Journal of Computational Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.inderscienceonline.com\/doi\/full\/10.1504\/IJCSE.2018.10011517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T11:36:42Z","timestamp":1534333002000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=10011517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1504\/ijcse.2018.10011517","relation":{},"ISSN":["1742-7185","1742-7193"],"issn-type":[{"type":"print","value":"1742-7185"},{"type":"electronic","value":"1742-7193"}],"subject":[],"published":{"date-parts":[[2018]]},"article-number":"10011517"}}