[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_3546bb2b-6814-44b7-83e0-3e87f0b9bedc":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:3546bb2b-6814-44b7-83e0-3e87f0b9bedc,\"}":756},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":669,"manageAffiliations":686,"indexDatabases":707,"url":26,"thumbnailPath":26,"statistic":747,"gsStatistic":26,"type":26,"analyzePriority":26},"3546bb2b-6814-44b7-83e0-3e87f0b9bedc","2024-04-17T04:09:39.286+00:00","2025-11-21T10:05:22.176+00:00",[],"Springer-Science-and-Business-Media-LLC",{"issn":665,"title":667},{"VOID":666},"0254-5330",{"EN":668},"Springer Science and Business Media LLC",[670,678],{"id":671,"createTime":672,"updateTime":673,"relativeEntities":674,"label":675,"description":677,"parentId":26,"standard":26,"scholarHubFieldId":26},"07306ffa-010f-4631-b7e1-995984b89682","2023-05-29T10:24:24.803+00:00","2023-11-20T13:27:09.758+00:00",[],{"EN":676},"Decision Sciences (miscellaneous)",{},{"id":679,"createTime":680,"updateTime":681,"relativeEntities":682,"label":683,"description":685,"parentId":26,"standard":26,"scholarHubFieldId":26},"1700c9d4-8702-4a01-8854-5ab9fde7d2df","2023-05-29T10:24:26.796+00:00","2023-11-21T07:28:56.604+00:00",[],{"EN":684},"Management Science and Operations Research",{},[687,698],{"id":688,"createTime":689,"updateTime":690,"relativeEntities":691,"slug":692,"properties":693,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"url":26,"parentIds":696,"statistic":26},"b2bfac93-563a-4fa4-bd81-e546a66bf9bd","2023-05-29T10:24:01.641+00:00","2025-11-21T10:06:17.751+00:00",[],"Springer-Netherlands",{"title":694},{"EN":695},"Springer Netherlands",[697],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":699,"createTime":700,"updateTime":701,"relativeEntities":702,"slug":703,"properties":704,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"url":26,"parentIds":706,"statistic":26},"26a19206-5cad-4456-bb2f-49abd254fbc6","2024-04-19T01:59:34.612+00:00","2025-11-21T10:06:47.646+00:00",[],"SPRINGER",{"title":705},{"EN":703},[],[708,728],{"id":709,"indexDatabase":710,"url":722,"indexYears":723,"academicFieldIds":724,"indexDatabaseRanking":727},"55559259-797f-4131-8926-c23e156cc50c",{"id":711,"createTime":712,"updateTime":713,"relativeEntities":714,"label":715,"description":717,"key":719,"publicationTags":720,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":716,"VI":716},"Scopus - Elsevier",{"EN":716,"VI":718},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[721],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F23090","1984-2025",[725,726],"9257bd7d-2e00-4865-a19e-9796f3a21c3f","03f15b37-0579-4479-840b-c8f409678c1a","SCOPUS__Q2",{"id":729,"indexDatabase":730,"url":744,"indexYears":26,"academicFieldIds":745,"indexDatabaseRanking":26},"2c8f15ea-cce9-41a7-9406-f54466a0d116",{"id":731,"createTime":732,"updateTime":733,"relativeEntities":734,"label":735,"description":737,"key":740,"publicationTags":741,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":736,"VI":736},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":738,"EN":739},"Cơ sở dữ liệu SCIE","SCIE database","scie",[742,743],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0254-5330",[746],"ef99e6f3-ace4-49a6-aa47-d5e24f7d2768",{"impactFactor":36,"impactFactorByYear":748,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":749,"totalCitation":750,"totalCitationByYear":751,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":754,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},635,{"2003":52,"2004":752},626,52.92,{"2003":52,"2004":755},56.91,{"meta":757,"data":759},{"total":758},"5622",[760,1097,1346,1615,1903,2172,2262,2498,3160,3382],{"id":761,"createTime":762,"updateTime":762,"relativeEntities":763,"slug":764,"properties":765,"entityType":776,"verifyStatus":25,"verifyTime":762,"verifyNote":777,"syncStatus":28,"languages":778,"translateLanguages":26,"viewCount":36,"primaryUrl":779,"fullTextUrl":26,"authors":780,"publicationType":866,"publisherRelationship":867,"citationCount":902,"citationInfo":903,"publishDate":913,"publishYear":914,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":915,"isForceReanalyzing":1096},"de98e580-e305-47c3-b09c-3bd934fb9471","2024-12-18T07:08:57.618+00:00",[],"A-Tutorial-on-the-Cross-Entropy-Method",{"mag":766,"keywords":768,"openalex":769,"abstract":771,"title":772,"doi":774},{"VOID":767},"2132083787",{},{"VOID":770},"W2132083787",{},{"EN":773},"A Tutorial on the Cross-Entropy Method",{"VOID":775},"10.1007\u002Fs10479-005-5724-z","PUBLICATION","Auto Verify",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10479-005-5724-z",[781,800,822,844],{"id":782,"sortIndex":59,"researcher":26,"roles":783,"affiliations":784,"properties":795},"d2d7edec-e605-4a0a-ab6b-0c562a418080",[],[785],{"id":786,"sortIndex":36,"affiliation":787,"properties":26},"d4f13a7e-98a3-4dbe-98e1-5f12d01bfb05",{"id":788,"createTime":789,"updateTime":789,"relativeEntities":790,"slug":791,"properties":792,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"aa522698-824d-4d97-b967-1929658bd95d","2024-12-18T07:08:57.658+00:00",[],"Department-of-Industrial-Engineering-Technion-Israel-Institute-of-Technology-Haifa-Israel-",{"title":793},{"EN":794},"Department of Industrial Engineering, Technion-Israel Institute of Technology, Haifa, Israel.",{"openalex":796,"title":798},{"VOID":797},"A5108352948",{"EN":799},"Reuven Y. Rubinstein",{"id":801,"sortIndex":36,"researcher":26,"roles":802,"affiliations":803,"properties":815},"48b64eac-42f5-4daf-b113-56112d50c1fd",[],[804],{"id":805,"sortIndex":36,"affiliation":806,"properties":26},"8a620ca6-114f-452a-9109-67d8bff2ecc6",{"id":807,"createTime":808,"updateTime":809,"relativeEntities":810,"slug":811,"properties":812,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"10d897fc-60db-42f2-8e65-7c6e025e1ae4","2023-12-05T12:12:32.069+00:00","2025-01-03T07:10:08.575+00:00",[],"Department-of-Electrical-Engineering-Mathematics-and-Computer-Science-University-of-Twente-Enschede-The-Netherlands",{"title":813},{"VI":814},"Department of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands",{"openalex":816,"orcid":818,"title":820},{"VOID":817},"A5085616535",{"VOID":819},"https:\u002F\u002Forcid.org\u002F0000-0002-0818-5295",{"EN":821},"Pieter-Tjerk de Boer",{"id":823,"sortIndex":115,"researcher":26,"roles":824,"affiliations":825,"properties":837},"2bd06ab0-5d9e-40e2-8345-09b23ad20c47",[],[826],{"id":827,"sortIndex":36,"affiliation":828,"properties":26},"e161ecdd-13f9-4d05-ad6c-c78db4c369cc",{"id":829,"createTime":830,"updateTime":831,"relativeEntities":832,"slug":833,"properties":834,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b3706f03-430c-4ff6-93cf-11106dd4560b","2023-11-30T01:24:27.080+00:00","2024-12-18T07:08:57.638+00:00",[],"Department-of-Mathematics-The-University-of-Queensland-Brisbane-Australia",{"title":835},{"VI":836},"Department of Mathematics, The University of Queensland, Brisbane, Australia",{"openalex":838,"orcid":840,"title":842},{"VOID":839},"A5088935199",{"VOID":841},"https:\u002F\u002Forcid.org\u002F0000-0003-2281-9431",{"EN":843},"Dirk P. Kroese",{"id":845,"sortIndex":114,"researcher":26,"roles":846,"affiliations":847,"properties":859},"ceba6ef1-77aa-4742-9394-ca225b234563",[],[848],{"id":849,"sortIndex":36,"affiliation":850,"properties":26},"26153ff2-5d88-41f0-bee7-f5d217e90078",{"id":851,"createTime":852,"updateTime":853,"relativeEntities":854,"slug":855,"properties":856,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"4a7287d8-0a57-4572-8658-5b920f228aa5","2023-12-25T10:20:52.795+00:00","2024-12-18T07:08:57.648+00:00",[],"Department-of-Electrical-and-Computer-Engineering-McGill-University-Montr%C3%A9al-Canada",{"title":857},{"VI":858},"Department of Electrical and Computer Engineering, McGill University, Montréal, Canada",{"openalex":860,"orcid":862,"title":864},{"VOID":861},"A5036260775",{"VOID":863},"https:\u002F\u002Forcid.org\u002F0000-0003-4439-7647",{"EN":865},"Shie Mannor","ARTICLE",{"url":26,"publisher":868,"properties":895},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":869,"slug":663,"properties":870,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":873,"manageAffiliations":874,"indexDatabases":875,"url":26,"thumbnailPath":26,"statistic":890,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":871,"title":872},{"VOID":666},{"EN":668},[],[],[876,883],{"id":729,"indexDatabase":877,"url":744,"indexYears":26,"academicFieldIds":882,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":878,"label":879,"description":880,"key":740,"publicationTags":881,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":884,"url":722,"indexYears":723,"academicFieldIds":889,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":885,"label":886,"description":887,"key":719,"publicationTags":888,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":891,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":892,"totalCitation":750,"totalCitationByYear":893,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":894,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":896,"pages":898,"issue":900},{"VOID":897},"134",{"VOID":899},"19-67",{"VOID":901},"1",2585,{"total":902,"publishYear":26,"statisticByYear":904},{"2012":905,"2013":204,"2014":359,"2015":249,"2016":282,"2017":535,"2018":906,"2019":907,"2020":908,"2021":909,"2022":910,"2023":911,"2024":912},61,145,212,272,319,334,355,258,"2005-02-01",2005,[916,919,923,927,931,935,939,942,945,949,953,957,960,963,967,971,975,978,981,984,987,990,994,998,1001,1005,1009,1013,1017,1021,1024,1027,1030,1033,1037,1041,1045,1049,1053,1056,1060,1064,1068,1072,1076,1079,1082,1086,1089,1093],{"id":26,"text":917,"url":26,"identifiers":918},"Aarts, E.H.L. and J.H.M Korst. (1989). Simulated Annealing and Boltzmann Machines. John Wiley & Sons.",{},{"id":26,"text":920,"url":26,"identifiers":921},"Alon, G., D.P. Kroese, T. Raviv, and R.Y. Rubinstein. (2005). “Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment.” Annals of Operations Research 134, 19–67.",{"doi":922},"10.1007\u002Fs10479-005-5728-8",{"id":26,"text":924,"url":26,"identifiers":925},"Asmussen, S., D.P. Kroese, and R.Y. Rubinstein. (2005). “Heavy Tails, Importance Sampling and Cross-Entropy.” Stochastic Models 21(1). To appear.",{"doi":926},"10.1081\u002FSTM-200046472",{"id":26,"text":928,"url":26,"identifiers":929},"Barto, A., R. Sutton, and C. Anderson. (1983). “Neuron-Like Adaptive Elements that can Solve Difficult Learning Control Problems.” IEEE Transactions on Systems, Man, and Cybernetics 13, 834–846.",{"doi":930},"10.1109\u002FTSMC.1983.6313077",{"id":26,"text":932,"url":26,"identifiers":933},"Barto, A.G. and R.S. Sutton. (1998). Reinforcement Learning. MIT Press.",{"doi":934},"10.1016\u002FS1474-6670(17)38315-5",{"id":26,"text":936,"url":26,"identifiers":937},"Baxter, J., P.L. Bartlett, and L. Weaver. (2001). Experiments with Infinite-Horizon, Policy-Gradient Estimation.” Journal of Artificial Intelligence Research 15, 351–381.",{"doi":938},"10.1613\u002Fjair.807",{"id":26,"text":940,"url":26,"identifiers":941},"Bertsekas, D.P. (1995). Dynamic Programming and Optimal Control. Athena Scientific.",{},{"id":26,"text":943,"url":26,"identifiers":944},"Bertsekas, D.P. and J.N. Tsitsiklis. (1995). Neuro-Dynamic Programming. Athena Scientific.",{},{"id":26,"text":946,"url":26,"identifiers":947},"Chepuri, K. and T. Homem-de-Mello. (2005). “Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method.” Annals of Operations Research 134, 153–181.",{"doi":948},"10.1007\u002Fs10479-005-5729-7",{"id":26,"text":950,"url":26,"identifiers":951},"Cohen, I., B. Golany, and A. Shtub. (2005). “Managing Stochastic Finite Capacity Multi-Project Systems Through the Cross-Entropy Method.” Annals of Operations Research 134, 183–199.",{"doi":952},"10.1007\u002Fs10479-005-5730-1",{"id":26,"text":954,"url":26,"identifiers":955},"Colorni, A., M. Dorigo, F. Maffioli, V. Maniezzo, G. Righini, and M. Trubian. (1996). “Heuristics from Nature for Hard Combinatorial Problems.” International Transactions in Operational Research 3(1), 1—21.",{"doi":956},"10.1111\u002Fj.1475-3995.1996.tb00032.x",{"id":26,"text":958,"url":26,"identifiers":959},"Dayan, P. and C. Watkins (1992). “Q-Learning.” Machine Learning 8, 279–292.",{},{"id":26,"text":961,"url":26,"identifiers":962},"de Boer, P.T. (2000). “Analysis and Efficient Simulation of Queueing Models of Telecommunication Systems.” Ph.D. thesis, University of Twente.",{},{"id":26,"text":964,"url":26,"identifiers":965},"de Boer, P.T., D.P. Kroese, and R.Y. Rubinstein. (2002).“Estimating Buffer Overflows in Three Stages using Cross-Entropy.” In Proceedings of the 2002 Winter Simulation Conference. San Diego, pp. 301–309.",{"doi":966},"10.1109\u002FWSC.2002.1172899",{"id":26,"text":968,"url":26,"identifiers":969},"de Boer, P.T., D.P. Kroese, and R.Y. Rubinstein. (2004). “A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks.” Management Science 50(7), 883–895.",{"doi":970},"10.1287\u002Fmnsc.1030.0139",{"id":26,"text":972,"url":26,"identifiers":973},"Dorigo, M., G. Di Caro, and L.M. Gambardella. (1999). “Ant Algorithms for Discrete Optimization.” Artificial Life 5(2), 137–172.",{"doi":974},"10.1162\u002F106454699568728",{"id":26,"text":976,"url":26,"identifiers":977},"Dubin, U. (2002). “Application of the Cross-Entropy Method to Neural Computation.” Master’s thesis, Technion, Electrical Engineering.",{},{"id":26,"text":979,"url":26,"identifiers":980},"Dubin, U. (2004). “Application of the Cross-Entropy Method for Image Segmentation.”Unpublished.",{},{"id":26,"text":982,"url":26,"identifiers":983},"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Company.",{},{"id":26,"text":985,"url":26,"identifiers":986},"Glover, F. and M. Laguna. (1993). Modern Heuristic Techniques for Combinatorial Optimization, chapter 3: Tabu search. Blackwell Scientific Publications.",{},{"id":26,"text":988,"url":26,"identifiers":989},"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley.",{},{"id":26,"text":991,"url":26,"identifiers":992},"Gutjahr, W.J. (2000). “A Graph-Based Ant System and Its Convergence.” Future Generations Computing 16, 873–888.",{"doi":993},"10.1016\u002FS0167-739X(00)00044-3",{"id":26,"text":995,"url":26,"identifiers":996},"Helvik, B.E. and O. Wittner. (2001). “Using the Cross-Entropy Method to Guide\u002FGovern Mobile Agent’s Path Finding in Networks.” In 3rd International Workshop on Mobile Agents for Telecommunication Applications—MATA’01.",{"doi":997},"10.1007\u002F3-540-44651-6_24",{"id":26,"text":999,"url":26,"identifiers":1000},"Homem-de-Mello, T. and R.Y. Rubinstein. (2002). “Rare Event Estimation for Static Models via Cross-Entropy and Importance Sampling.” (submitted for publication).",{},{"id":26,"text":1002,"url":26,"identifiers":1003},"Hui, K.-P., N. Bean, M. Kraetzl, and D.P. Kroese. (2005). “The Cross-Entropy Method for Network Reliability Estimation.”Annals of Operations Research 134, 101–118.",{"doi":1004},"10.1007\u002Fs10479-005-5726-x",{"id":26,"text":1006,"url":26,"identifiers":1007},"Kaelbling, L.P., M. Littman, and A.W. Moore. (1996). “Reinforcement Learning—A Survey.” Journal of Artificial Intelligence Research 4, 237–285.",{"doi":1008},"10.1613\u002Fjair.301",{"id":26,"text":1010,"url":26,"identifiers":1011},"Keith, J. and D.P. Kroese. (2002). “SABRES: Sequence Alignment By Rare Event Simulation.” In Proceedings of the 2002 Winter Simulation Conference, San Diego, pp. 320–327.",{"doi":1012},"10.1109\u002FWSC.2002.1172901",{"id":26,"text":1014,"url":26,"identifiers":1015},"Konda, V.R. and J.N. Tsitsiklis. (2003). “Actor-Critic Algorithms.” SIAM Journal on Control and Optimization 42(4), 1134–1166.",{"doi":1016},"10.1137\u002FS0363012901385691",{"id":26,"text":1018,"url":26,"identifiers":1019},"Kroese, D.P. and R.Y. Rubinstein. (2004). “The Transform Likelihood Ratio Method for Rare Event Simulation with Heavy Tails.” Queueing Systems 46, 317–351.",{"doi":1020},"10.1023\u002FB:QUES.0000027989.97672.be",{"id":26,"text":1022,"url":26,"identifiers":1023},"Lieber, D. (1998). “Rare-Events Estimation via Cross-Entropy and Importance Sampling.” Ph.D. thesis, William Davidson Faculty of Industrial Engineering and Management, Technion, Haifa, Israel.",{},{"id":26,"text":1025,"url":26,"identifiers":1026},"Mannor, S., R.Y. Rubinstein, and Y. Gat. (2003). “The Cross-Entropy Method for Fast Policy Search.” In Proceedings of the Twentieth International Conference on Machine Learning. Morgan Kaufmann, pp. 512–519.",{},{"id":26,"text":1028,"url":26,"identifiers":1029},"Margolin, L. (2002). “Application of the Cross-Entropy Method to Scheduling Problems.” Master’s thesis, Technion, Industrial Engineering.",{},{"id":26,"text":1031,"url":26,"identifiers":1032},"Margolin, L. (2004). “The Cross-Entropy Method for the Single Machine Total Weighted Tardiness Problem.” Unpublished.",{},{"id":26,"text":1034,"url":26,"identifiers":1035},"Margolin, L. (2005).“On the Convergence of the Cross-Entropy Method.” Annals of Operations Research 134, 201–214.",{"doi":1036},"10.1007\u002Fs10479-005-5731-0",{"id":26,"text":1038,"url":26,"identifiers":1039},"Menache, I., S. Mannor, and N. Shimkin. (2005). “Basis Function Adaption in Temporal Difference Reinforcement Learning.”Annals of Operations Research 134, 215–238.",{"doi":1040},"10.1007\u002Fs10479-005-5732-z",{"id":26,"text":1042,"url":26,"identifiers":1043},"Papadimitriou, C.H. and M. Yannakakis. (1991). “Optimization, Approximation, and Complexity Classes.”J. Comput. System Sci. 43, 425–440.",{"doi":1044},"10.1016\u002F0022-0000(91)90023-X",{"id":26,"text":1046,"url":26,"identifiers":1047},"Puterman, M. (1994). Markov Decision Processes. Wiley-Interscience.",{"doi":1048},"10.1002\u002F9780470316887",{"id":26,"text":1050,"url":26,"identifiers":1051},"Ridder, A. (2005). “Importance Sampling Simulations of Markovian Reliability Systems Using Cross-Entropy.”Annals of Operations Research 134, 119–136.",{"doi":1052},"10.1007\u002Fs10479-005-5727-9",{"id":26,"text":1054,"url":26,"identifiers":1055},"Rosenstein, M.T. and A.G. Barto. (2001). “Robot Weightlifting by Direct Policy Search.” In B. Nebel (ed.). Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 839–846.",{},{"id":26,"text":1057,"url":26,"identifiers":1058},"Rubinstein, R.Y. (1997). “Optimization of Computer Simulation Models with Rare Events.”European Journal of Operations Research 99, 89–112.",{"doi":1059},"10.1016\u002FS0377-2217(96)00385-2",{"id":26,"text":1061,"url":26,"identifiers":1062},"Rubinstein, R.Y. (1999). “The Simulated Entropy Method for Combinatorial and Continuous Optimization.”Methodology and Computing in Applied Probability 2, 127–190.",{"doi":1063},"10.1023\u002FA:1010091220143",{"id":26,"text":1065,"url":26,"identifiers":1066},"Rubinstein, R.Y. (2001). “Combinatorial Optimization, Cross-Entropy, Ants and Rare Events.”In S. Uryasev and P.M. Pardalos (eds.). Stochastic Optimization: Algorithms and Applications. Kluwer, pp. 304–358.",{"doi":1067},"10.1007\u002F978-1-4757-6594-6_14",{"id":26,"text":1069,"url":26,"identifiers":1070},"Rubinstein, R.Y. (2002). “Cross-Entropy and Rare-Events for Maximal Cut and Bipartition Problems.”ACM Transactions on Modeling and Computer Simulation, 27–53.",{"doi":1071},"10.1145\u002F511442.511444",{"id":26,"text":1073,"url":26,"identifiers":1074},"Rubinstein, R.Y. and D.P. Kroese. (2004). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer-Verlag, New York.",{"doi":1075},"10.1007\u002F978-1-4757-4321-0",{"id":26,"text":1077,"url":26,"identifiers":1078},"Rubinstein, R.Y. and B. Melamed. (1998). Modern Simulation and Modeling. Wiley series in probability and Statistics.",{},{"id":26,"text":1080,"url":26,"identifiers":1081},"Rubinstein, R.Y. and A. Shapiro. (1993). Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization via the Score Function Method. Wiley.",{},{"id":26,"text":1083,"url":26,"identifiers":1084},"Shi, L. and S. Olafsson. (2000). “Nested Partitioning Method for Global Optimization.” Operations Research 48(3), 390–407.",{"doi":1085},"10.1287\u002Fopre.48.3.390.12436",{"id":26,"text":1087,"url":26,"identifiers":1088},"Sutton, R.S., D. McAllester, S. Singh, and Y. Mansour. (2000). “Policy Gradient Methods for Reinforcement Learning with Function Approximation.” In Advances in Neural Information Processing Systems 12. MIT Press, pp. 1057–1063.",{},{"id":26,"text":1090,"url":26,"identifiers":1091},"Voudouris, C. (2003). “Guided Local Search—An Illustrative Example in Function Optimisation.”BT Technology Journal 16(3), 46–50.",{"doi":1092},"10.1023\u002FA:1009665513140",{"id":26,"text":1094,"url":26,"identifiers":1095},"Webb, A. (1999). Statistical Pattern Recognition. Arnold.",{},false,{"id":1098,"createTime":1099,"updateTime":1099,"relativeEntities":1100,"slug":1101,"properties":1102,"entityType":776,"verifyStatus":25,"verifyTime":1113,"verifyNote":777,"syncStatus":28,"languages":1114,"translateLanguages":26,"viewCount":36,"primaryUrl":1115,"fullTextUrl":26,"authors":1116,"publicationType":866,"publisherRelationship":1139,"citationCount":1174,"citationInfo":1175,"publishDate":1178,"publishYear":1179,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1180,"isForceReanalyzing":1096},"84f3606f-3a7d-4a99-ab08-bdc7e0350db1","2024-09-01T12:47:12.187+00:00",[],"Routing-and-scheduling-in-a-flexible-job-shop-by-tabu-search",{"mag":1103,"keywords":1105,"openalex":1106,"abstract":1108,"title":1109,"doi":1111},{"VOID":1104},"2046437335",{},{"VOID":1107},"W2046437335",{},{"EN":1110},"Routing and scheduling in a flexible job shop by tabu search",{"VOID":1112},"10.1007\u002Fbf02023073","2024-09-01T12:47:12.186+00:00",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02023073",[1117],{"id":1118,"sortIndex":36,"researcher":26,"roles":1119,"affiliations":1120,"properties":1132},"77bead0b-3062-438f-ae4c-688d7ebc1de9",[],[1121],{"id":1122,"sortIndex":36,"affiliation":1123,"properties":26},"d6bac00f-9149-4a18-8b08-e5867c9616be",{"id":1124,"createTime":1125,"updateTime":1126,"relativeEntities":1127,"slug":1128,"properties":1129,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"c445c073-ab6b-4352-8e3b-3550a6c887a3","2023-12-11T22:17:33.085+00:00","2024-09-01T12:47:12.200+00:00",[],"Dipartimento-di-Sistemi-di-Produzione-ed-Economia-dell-Azienda-Politecnico-di-Torino-Torino-Italy",{"title":1130},{"VI":1131},"Dipartimento di Sistemi di Produzione ed Economia dell'Azienda, Politecnico di Torino, Torino, Italy",{"openalex":1133,"orcid":1135,"title":1137},{"VOID":1134},"A5067216728",{"VOID":1136},"https:\u002F\u002Forcid.org\u002F0000-0002-6533-3055",{"EN":1138},"Paolo Brandimarte",{"url":26,"publisher":1140,"properties":1167},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1141,"slug":663,"properties":1142,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1145,"manageAffiliations":1146,"indexDatabases":1147,"url":26,"thumbnailPath":26,"statistic":1162,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1143,"title":1144},{"VOID":666},{"EN":668},[],[],[1148,1155],{"id":729,"indexDatabase":1149,"url":744,"indexYears":26,"academicFieldIds":1154,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":1150,"label":1151,"description":1152,"key":740,"publicationTags":1153,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":1156,"url":722,"indexYears":723,"academicFieldIds":1161,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":1157,"label":1158,"description":1159,"key":719,"publicationTags":1160,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":1163,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":1164,"totalCitation":750,"totalCitationByYear":1165,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":1166,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":1168,"pages":1170,"issue":1172},{"VOID":1169},"41",{"VOID":1171},"157-183",{"VOID":1173},"3",955,{"total":1174,"publishYear":26,"statisticByYear":1176},{"2012":286,"2013":48,"2014":285,"2015":204,"2016":48,"2017":257,"2018":281,"2019":569,"2020":250,"2021":44,"2022":357,"2023":1177,"2024":47},105,"1993-09-01",1993,[1181,1185,1189,1193,1196,1200,1203,1206,1209,1213,1217,1220,1223,1227,1230,1233,1237,1241,1244,1247,1251,1255,1259,1263,1267,1271,1275,1278,1281,1285,1289,1293,1297,1301,1305,1308,1312,1316,1320,1323,1327,1331,1334,1338,1342],{"id":26,"text":1182,"url":26,"identifiers":1183},"J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Manag. Sci. 34(1988)391–401.",{"doi":1184},"10.1287\u002Fmnsc.34.3.391",{"id":26,"text":1186,"url":26,"identifiers":1187},"R. Akella, Y. Choong and S.B. Gershwin, Performance of a hierarchical production scheduling policy, IEEE Trans. Components, Hybrids and Manufacturing Technol. CHMT-7(1984)225–248.",{"doi":1188},"10.1109\u002FTCHMT.1984.1136360",{"id":26,"text":1190,"url":26,"identifiers":1191},"E. Balas, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm, Oper. Res. 17(1969)941–957.",{"doi":1192},"10.1287\u002Fopre.17.6.941",{"id":26,"text":1194,"url":26,"identifiers":1195},"J.W. Barnes and J.B. Chambers, Solving the job shop scheduling problem using tabu search, Technical Report ORP91-06, University of Texas at Austin (1991).",{},{"id":26,"text":1197,"url":26,"identifiers":1198},"B. Bona, P. Brandimarte, C. Greco and G. Menga, Hybrid hierarchical scheduling and control systems in manufacturing, IEEE Trans. Robotics and Automation RA-6(1990)673–686.",{"doi":1199},"10.1109\u002F70.63270",{"id":26,"text":1201,"url":26,"identifiers":1202},"P. Brandimarte, R. Conterno and P. Laface, FMS production scheduling by simulated annealing,Proc. 3rd Conf. on Simulation in Manufacturing, Torino (Nov. 1987) pp. 235–245.",{},{"id":26,"text":1204,"url":26,"identifiers":1205},"P. Brandimarte, Using abstract data types in developing search-based schedulers,Proc. ICARV'90 (Int. Conf. on Automation, Robotics and Computer Vision), Singapore (1990) pp. 6–10.",{},{"id":26,"text":1207,"url":26,"identifiers":1208},"P. Brandimarte, Bicriteria parallel machine scheduling by local search, in preparation.",{},{"id":26,"text":1210,"url":26,"identifiers":1211},"P. Brandimarte, W. Ukovich and A. Villa, Factory level aggregate scheduling: a basis for a hierarchical approach,Proc. 1992 IEEE Conf. on CIM, RPI, Troy, NY.",{"doi":1212},"10.1109\u002FCIM.1992.639142",{"id":26,"text":1214,"url":26,"identifiers":1215},"Y.-L. Chang, H. Matsuo and R.S. Sullivan, A bottleneck-based beam search for job scheduling in a flexible manufacturing system, Int. J. Prod. Res. 27(1989)1949–1961.",{"doi":1216},"10.1080\u002F00207548908942666",{"id":26,"text":1218,"url":26,"identifiers":1219},"L.F. Esudero, A mathematical formulation of a hierarchical approach for production planning in FMS, in:Modern Production Management Systems, ed. A. Kusiak (North-Holland, 1987) pp. 231–245.",{},{"id":26,"text":1221,"url":26,"identifiers":1222},"L.F. Escudero, An inexact algorithm for part input sequencing and scheduling with side constraints in FMS, Int. J. Flexible Manufacturing Syst. 1(1989)143–174.",{},{"id":26,"text":1224,"url":26,"identifiers":1225},"E. Falkenauer and S. Bouffouix, A genetic algorithm for job shop,Proc. 1991 IEEE Conf. on Robotics and Automation, Sacramento, CA, pp. 824–829.",{"doi":1226},"10.1109\u002FROBOT.1991.131689",{"id":26,"text":1228,"url":26,"identifiers":1229},"R. Fletcher,Practical Methods of Optimization, 2nd ed. (Wiley, 1987).",{},{"id":26,"text":1231,"url":26,"identifiers":1232},"S. French,Sequencing and Scheduling: an Introduction to the Mathematics of Job Shop (Wiley, 1982).",{},{"id":26,"text":1234,"url":26,"identifiers":1235},"F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.",{"doi":1236},"10.1287\u002Fijoc.1.3.190",{"id":26,"text":1238,"url":26,"identifiers":1239},"F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4–32.",{"doi":1240},"10.1287\u002Fijoc.2.1.4",{"id":26,"text":1242,"url":26,"identifiers":1243},"F. Glover and R. Hübscher, Bin packing with tabu search, preprint (1991).",{},{"id":26,"text":1245,"url":26,"identifiers":1246},"D.E. Goldberg,Genetic Algorithms in Search, Optimization and Machine Learning (Wiley, 1989).",{},{"id":26,"text":1248,"url":26,"identifiers":1249},"J. Hutchison, K. Leong, D. Snyder and P. Ward, Scheduling approaches for random job shop flexible manufacturing systems, Int. J. Prod. Res. 29(1991)1053–1067.",{"doi":1250},"10.1080\u002F00207549108930119",{"id":26,"text":1252,"url":26,"identifiers":1253},"Y.-D. Kim, A comparison of dispatching rules for job shops with multiple identical jobs and alternative routings, Int. J. Prod. Res. 28(1990)953–962.",{"doi":1254},"10.1080\u002F00207549008942766",{"id":26,"text":1256,"url":26,"identifiers":1257},"E.J. Lee and P. Mirchandani, Concurrent routing, sequencing and setups for a two-machine flexible manufacturing cell, IEEE J. Robotics and Automation RA-4(1988)256–264.",{"doi":1258},"10.1109\u002F56.786",{"id":26,"text":1260,"url":26,"identifiers":1261},"S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)621–680.",{"doi":1262},"10.1126\u002Fscience.220.4598.671",{"id":26,"text":1264,"url":26,"identifiers":1265},"M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single machine scheduling problem, J. Int. Manufacturing 2(1991)63–74.",{"doi":1266},"10.1007\u002FBF01471219",{"id":26,"text":1268,"url":26,"identifiers":1269},"M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Syst. Appl., to appear.",{"doi":1270},"10.1016\u002F0957-4174(93)90056-C",{"id":26,"text":1272,"url":26,"identifiers":1273},"M. Laguna and J.L.G. Velarde, A search heuristic for just-in-time scheduling in parallel machines, J. Int. Manufacturing 2(1991)253–260.",{"doi":1274},"10.1007\u002FBF01471113",{"id":26,"text":1276,"url":26,"identifiers":1277},"B. Meyer,Object-Oriented Software Construction (Prentice-Hall, 1988).",{},{"id":26,"text":1279,"url":26,"identifiers":1280},"P. Mirchandani, E.J. Lee and A. Vasque, Concurrent scheduling in flexible automation, Technical Report No. 37-88-149, Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY (1988).",{},{"id":26,"text":1282,"url":26,"identifiers":1283},"M. Montazeri and L.N. Van Wassenhove, Analysis of scheduling rules for an FMS, Int. J. Prod. Res. 28(1990)785–802.",{"doi":1284},"10.1080\u002F00207549008942754",{"id":26,"text":1286,"url":26,"identifiers":1287},"N. Nasr and E.A. Elsayed, Job shop scheduling with alternative machines, Int. J. Prod. Res. 28(1990)1595–1609.",{"doi":1288},"10.1080\u002F00207549008942818",{"id":26,"text":1290,"url":26,"identifiers":1291},"F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of then\u002Fm\u002FC max flowshop problem, Comput. Oper.Res. 17(1990)243–253.",{"doi":1292},"10.1016\u002F0305-0548(90)90001-N",{"id":26,"text":1294,"url":26,"identifiers":1295},"I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, OMEGA Int. J. Manag. Sci. 17(1989)551–557.",{"doi":1296},"10.1016\u002F0305-0483(89)90059-5",{"id":26,"text":1298,"url":26,"identifiers":1299},"P.S. Ow and T.E. Morton, Filtered beam search in scheduling, Int. J. Prod. Res. 26(1988)35–62.",{"doi":1300},"10.1080\u002F00207548808947840",{"id":26,"text":1302,"url":26,"identifiers":1303},"S.S. Panwalkar and W. Iskander, A survey of scheduling rules, Oper. Res. 25(1977)45–61.",{"doi":1304},"10.1287\u002Fopre.25.1.45",{"id":26,"text":1306,"url":26,"identifiers":1307},"R.G. Parker and R.L. Rardin,Discrete Optimization (Wiley, 1988).",{},{"id":26,"text":1309,"url":26,"identifiers":1310},"G.N. Saridis, Analytical formulation of the principle of increasing precision with decreasing intelligence for intelligent machines, Automatica 25(1989)461–467.",{"doi":1311},"10.1016\u002F0005-1098(89)90016-2",{"id":26,"text":1313,"url":26,"identifiers":1314},"T. Sawik, Modelling and scheduling of a flexible manufacturing system, Eur. J. Oper. Res. 45(1990)177–190.",{"doi":1315},"10.1016\u002F0377-2217(90)90183-C",{"id":26,"text":1317,"url":26,"identifiers":1318},"K.E. Stecke, Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Manag. Sci. 29(1983)273–288.",{"doi":1319},"10.1287\u002Fmnsc.29.3.273",{"id":26,"text":1321,"url":26,"identifiers":1322},"E. Taillard, Parallel taboo search technique for the job shop scheduling problem, Research Report ORWP 89\u002F11, Ecole Polytechnique Fédérale de Lausanne (1989).",{},{"id":26,"text":1324,"url":26,"identifiers":1325},"E. Tocylowski, K.S. Hindi and M.G. Singh, Multi-level production scheduling for a class of flexible machine and assembly systems, Ann. Oper. Res. 17(1989)163–180.",{"doi":1326},"10.1007\u002FBF02096603",{"id":26,"text":1328,"url":26,"identifiers":1329},"P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Reidel, 1987).",{"doi":1330},"10.1007\u002F978-94-015-7744-1",{"id":26,"text":1332,"url":26,"identifiers":1333},"P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Report OS-R8809, CWI, Amsterdam (1988).",{},{"id":26,"text":1335,"url":26,"identifiers":1336},"A.P.J. Vepsalainen and T.E. Morton, Priority rules for job shops with weighted tardiness costs, Manag. Sci. 33(1987)1035–1047.",{"doi":1337},"10.1287\u002Fmnsc.33.8.1035",{"id":26,"text":1339,"url":26,"identifiers":1340},"M. Widmer, Job shop scheduling with tooling constraints: a tabu search approach, J. Oper. Res. Soc. 42(1991)75–82.",{"doi":1341},"10.1057\u002Fjors.1991.9",{"id":26,"text":1343,"url":26,"identifiers":1344},"M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem, Eur. J. Oper. Res. 41(1989)186–193.",{"doi":1345},"10.1016\u002F0377-2217(89)90383-4",{"id":1347,"createTime":1348,"updateTime":1349,"relativeEntities":1350,"slug":1351,"properties":1352,"entityType":776,"verifyStatus":25,"verifyTime":1349,"verifyNote":777,"syncStatus":28,"languages":1363,"translateLanguages":26,"viewCount":36,"primaryUrl":1364,"fullTextUrl":26,"authors":1365,"publicationType":866,"publisherRelationship":1421,"citationCount":1449,"citationInfo":1450,"publishDate":1452,"publishYear":1179,"citationAnalyzeStatus":1453,"lastCitationAnalyze":1454,"indexDatabases":26,"openAccess":26,"references":1455,"isForceReanalyzing":1096},"681b1078-5821-4e20-9ea9-37f6f0519142","2024-04-11T15:09:47.332+00:00","2025-01-20T02:00:28.231+00:00",[],"A-user-s-guide-to-tabu-search",{"mag":1353,"keywords":1355,"openalex":1356,"abstract":1358,"title":1359,"doi":1361},{"VOID":1354},"2114951958",{},{"VOID":1357},"W2114951958",{},{"EN":1360},"A user's guide to tabu search",{"VOID":1362},"10.1007\u002Fbf02078647",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02078647",[1366,1384,1403],{"id":1367,"sortIndex":115,"researcher":26,"roles":1368,"affiliations":1369,"properties":1379},"d3c395a9-45b8-433f-83b0-c3219912cba6",[],[1370],{"id":26,"sortIndex":36,"affiliation":1371,"properties":26},{"id":1372,"createTime":1373,"updateTime":1373,"relativeEntities":1374,"slug":1375,"properties":1376,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"fb686034-8f11-403e-a30e-a093029d43e8","2024-04-11T15:09:47.351+00:00",[],"Dept-of-Mathematics-Swiss-Federal-Institute-of-Technology-Lausanne-Switzerland",{"title":1377},{"EN":1378},"Dept. of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland",{"openalex":1380,"title":1382},{"VOID":1381},"A5071782451",{"EN":1383},"Éric D. Taillard",{"id":1385,"sortIndex":36,"researcher":26,"roles":1386,"affiliations":1387,"properties":1396},"bdfba5a4-92b5-45d2-840b-d32d2f579ee6",[],[1388],{"id":26,"sortIndex":36,"affiliation":1389,"properties":26},{"id":1390,"createTime":1391,"updateTime":1391,"relativeEntities":1392,"slug":26,"properties":1393,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"f87d0273-cac4-4b16-9e27-1a66897315c7","2024-01-11T02:28:16.165+00:00",[],{"title":1394},{"VI":1395},"Graduate School of Business, University of Colorado, Boulder, USA",{"openalex":1397,"orcid":1399,"title":1401},{"VOID":1398},"A5068174754",{"VOID":1400},"https:\u002F\u002Forcid.org\u002F0000-0001-6945-0438",{"EN":1402},"Fred Glover",{"id":1404,"sortIndex":114,"researcher":26,"roles":1405,"affiliations":1406,"properties":1416},"a8fac75c-c66d-4a11-9f74-0762a9eda864",[],[1407],{"id":26,"sortIndex":36,"affiliation":1408,"properties":26},{"id":1409,"createTime":1410,"updateTime":1410,"relativeEntities":1411,"slug":1412,"properties":1413,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"c5228502-ff90-4cb9-bc03-e9f49fc7b380","2024-04-11T15:09:47.363+00:00",[],"Department-of-Mathematics-Swiss-Federal-Institute-of-Technology-Lausanne-Switzerland",{"title":1414},{"EN":1415},"Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland",{"openalex":1417,"title":1419},{"VOID":1418},"A5074966723",{"EN":1420},"Dominique de Werra",{"url":26,"publisher":1422,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1423,"slug":663,"properties":1424,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1427,"manageAffiliations":1428,"indexDatabases":1429,"url":26,"thumbnailPath":26,"statistic":1444,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1425,"title":1426},{"VOID":666},{"EN":668},[],[],[1430,1437],{"id":729,"indexDatabase":1431,"url":744,"indexYears":26,"academicFieldIds":1436,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":1432,"label":1433,"description":1434,"key":740,"publicationTags":1435,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":1438,"url":722,"indexYears":723,"academicFieldIds":1443,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":1439,"label":1440,"description":1441,"key":719,"publicationTags":1442,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":1445,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":1446,"totalCitation":750,"totalCitationByYear":1447,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":1448,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},774,{"total":1449,"publishYear":26,"statisticByYear":1451},{"2012":237,"2013":124,"2014":255,"2015":336,"2016":173,"2017":298,"2018":173,"2019":298,"2020":356,"2021":124,"2022":173,"2023":336,"2024":59},"1993-03-01","ERROR_IN_ANALYZE_CITATION","2024-04-11T17:17:42.131+00:00",[1456,1460,1464,1468,1471,1475,1478,1481,1485,1488,1491,1494,1498,1502,1505,1508,1511,1514,1518,1522,1525,1529,1533,1536,1540,1544,1547,1550,1552,1555,1559,1563,1567,1571,1575,1577,1580,1583,1587,1590,1593,1597,1601,1604,1608,1611],{"id":26,"text":1457,"url":26,"identifiers":1458},"R.E. Burkard, Quadratic assignment problems, Eur. J. Oper. Res. 15(1984)283–289.",{"doi":1459},"10.1016\u002F0377-2217(84)90093-6",{"id":26,"text":1461,"url":26,"identifiers":1462},"J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for quadratic assignment problem, Ann. Oper. Res. (1993), this volume.",{"doi":1463},"10.1007\u002FBF02022999",{"id":26,"text":1465,"url":26,"identifiers":1466},"Committee on the Next Decade of Operations Research (Condor), Operations research: The next decade, Oper. Res. 36(1988).",{"doi":1467},"10.1287\u002Fopre.36.4.619",{"id":26,"text":1469,"url":26,"identifiers":1470},"D. Costa, A tabu search algorithm for computing an operational time table, Working Paper, Département de Mathématiques, École Polytechnique Fédérale de Lausanne, Switzerland (1990).",{},{"id":26,"text":1472,"url":26,"identifiers":1473},"F. Dammeyer and S. Voss, Dynamic tabu list management using the reverse elimination method, Ann. Oper Res. (1993), this volume.",{"doi":1474},"10.1007\u002FBF02022561",{"id":26,"text":1476,"url":26,"identifiers":1477},"C.N. Fiechter, A parallel tabu search algorithm for large scale traveling salesman problems, Working Paper 90\u002F1, Département de Mathématiques, Ècole Polythechnique Fédérale de Lausanne, Switzerland (1990).",{},{"id":26,"text":1479,"url":26,"identifiers":1480},"G. Finke, R.E. Burkard and F. Rendl, Quadratic assignment problems, Ann. Discr. Math. 31(1987)61–82.",{},{"id":26,"text":1482,"url":26,"identifiers":1483},"A. Frieze, J. Yadegas, S. El-Horbaty and D. Parkinson, Algorithms for assignment problems on an array processor, Parallel Comp. 11(1989)151–162.",{"doi":1484},"10.1016\u002F0167-8191(89)90025-2",{"id":26,"text":1486,"url":26,"identifiers":1487},"B. Gavish, Manifold search techniques applied to the quadratic assignment problem, Technical Report, Owen Graduate School of Management, Vanderbilt University (1991).",{},{"id":26,"text":1489,"url":26,"identifiers":1490},"M. Gendreau, A. Hertz and G. Laporte, New intersection and post-optimization procedures for the traveling salesman problem, CRT-708, Centre de Recherche sur les Transports, Université de Montréal (1990).",{},{"id":26,"text":1492,"url":26,"identifiers":1493},"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristics for the vehicle routing problem, CRT-777, Centre de Recherche sur les Transports, Université de Montréal (1991) to appear in Manag. Sci.",{},{"id":26,"text":1495,"url":26,"identifiers":1496},"F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156–166.",{"doi":1497},"10.1111\u002Fj.1540-5915.1977.tb01074.x",{"id":26,"text":1499,"url":26,"identifiers":1500},"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533–549.",{"doi":1501},"10.1016\u002F0305-0548(86)90048-1",{"id":26,"text":1503,"url":26,"identifiers":1504},"F. Glover, Tabu search-Part I, ORSA J. Comput. 1(1989)190–206.",{"doi":1236},{"id":26,"text":1506,"url":26,"identifiers":1507},"F. Glover, Candidate list strategies and tabu search, CAAI Research Report, University of Colorado, Boulder (July 1989).",{},{"id":26,"text":1509,"url":26,"identifiers":1510},"F. Glover, Tabu search-Part II, ORSA J. Comput. 2(1990)4–32.",{"doi":1240},{"id":26,"text":1512,"url":26,"identifiers":1513},"F. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder (1991), to appear in Discr. Appl. Math.",{},{"id":26,"text":1515,"url":26,"identifiers":1516},"F. Glover, R. Glover and D. Klingman, The threshold assignment algorithm, Math. Progr. Study 26(1986)12–37.",{"doi":1517},"10.1007\u002FBFb0121086",{"id":26,"text":1519,"url":26,"identifiers":1520},"F. Glover, D. Klingman and N. Phillips, A network related nuclear power plant model with an intelligent branch and bound solution approach, Ann. Oper. Res. 21(1990)317–332.",{"doi":1521},"10.1007\u002FBF02022105",{"id":26,"text":1523,"url":26,"identifiers":1524},"P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming,Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986).",{},{"id":26,"text":1526,"url":26,"identifiers":1527},"P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44(1990)279–303.",{"doi":1528},"10.1007\u002FBF02241270",{"id":26,"text":1530,"url":26,"identifiers":1531},"A. Hertz and D. de Werra, Using tabu search technique for graph coloring, Computing 39(1987)345–451.",{"doi":1532},"10.1007\u002FBF02239976",{"id":26,"text":1534,"url":26,"identifiers":1535},"A. Hertz and D. de Werra, Informatique et Horaires Scolaires, Output 12(1989)53–56.",{},{"id":26,"text":1537,"url":26,"identifiers":1538},"D. Johnson, Local optimization and the traveling salesman problem,Proc. 17th Annual Colloquim on Automata, Languages and Programming (Springer, 1990) pp. 446–461.",{"doi":1539},"10.1007\u002FBFb0032050",{"id":26,"text":1541,"url":26,"identifiers":1542},"J.P. Kelly, B.L. Golden and A.A. Assad, Large-scale controlled rounding using tabu search with strategic oscillation, Ann. Oper. Res. (1993), this volume.",{"doi":1543},"10.1007\u002FBF02022563",{"id":26,"text":1545,"url":26,"identifiers":1546},"J. Knox, The application of tabu search to the symmetric traveling salesman problem, Ph.D. thesis, Graduate School of Business, University of Colorado.",{},{"id":26,"text":1548,"url":26,"identifiers":1549},"A. Kohlen and D. Pesch, Genetic local search in combinatorial optimization, to appear in Discr. Appl. Math. (1991).",{},{"id":26,"text":1264,"url":26,"identifiers":1551},{"doi":1266},{"id":26,"text":1553,"url":26,"identifiers":1554},"M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, School of Business, University of Colorado, Boulder (1991), to appear in Expert Systems with Application: An International Journal.",{},{"id":26,"text":1556,"url":26,"identifiers":1557},"S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21(1973)498–516.",{"doi":1558},"10.1287\u002Fopre.21.2.498",{"id":26,"text":1560,"url":26,"identifiers":1561},"M. Malek, M. Guruswamy, H. Owens and M. Pandya, Serial and parallel search techniques for the traveling salesman problem, Ann. Oper. Res. (1989).",{"doi":1562},"10.1007\u002FBF02022093",{"id":26,"text":1564,"url":26,"identifiers":1565},"E.L. Mooney and R.L. Rardin, Tabu search for a class of scheduling problems, Ann. Oper. Res. (1993), this volume.",{"doi":1566},"10.1007\u002FBF02023077",{"id":26,"text":1568,"url":26,"identifiers":1569},"H. Muhlenbein, Parallel genetic algorithms and combinatorial optimization, to appear in SIAM J. Optim. (1991).",{"doi":1570},"10.1007\u002F3-540-55027-5_23",{"id":26,"text":1572,"url":26,"identifiers":1573},"I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. (1993), this volume.",{"doi":1574},"10.1007\u002FBF02023004",{"id":26,"text":1298,"url":26,"identifiers":1576},{"doi":1300},{"id":26,"text":1578,"url":26,"identifiers":1579},"E. Rolland and H. Pirkul, Heuristic search for graph partitioning,31st Joint National TIMS\u002FORSA Meeting, Nashville, TN (1991).",{},{"id":26,"text":1581,"url":26,"identifiers":1582},"F. Semet and I. Loewenton, The traveling salesman problem under accessibility constraints, Report ORWP 92\u002F02, DMA, EPFL (1992).",{},{"id":26,"text":1584,"url":26,"identifiers":1585},"F. Semet and E. Taillard, Solving real-life VRPS efficiently using TS, Ann. Oper. Res. (1993), this volume.",{"doi":1586},"10.1007\u002FBF02023006",{"id":26,"text":1588,"url":26,"identifiers":1589},"J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, Harriman School Working Paper HAR-90-006, State University of New York at Stony Brook (1990).",{},{"id":26,"text":1591,"url":26,"identifiers":1592},"E. Taillard, Parallel tabu search for the jobshop scheduling problem, Research Report ORWP 89\u002F11, EPFL, DMA Lausanne, Switzerland (1989).",{},{"id":26,"text":1594,"url":26,"identifiers":1595},"E. Taillard, Some efficient heuristic methods for the flowshop sequencing problem, Euro. J. Oper. Res. 47(1990)65–79.",{"doi":1596},"10.1016\u002F0377-2217(90)90090-X",{"id":26,"text":1598,"url":26,"identifiers":1599},"E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comp. 17(1991)443–455.",{"doi":1600},"10.1016\u002FS0167-8191(05)80147-4",{"id":26,"text":1602,"url":26,"identifiers":1603},"N. Ulder, E, Aarts, H.-J. Bandelt, P. van Laarhoven and E. Pesch, Genetic local search algorithms for the traveling salesman problem,Proc. 1st Int. Workshop on Parallel Problem Solving, ed. Schwefel and Manner, Lecture Notes in Computer Science 496(1991) pp. 109–116.",{},{"id":26,"text":1605,"url":26,"identifiers":1606},"D. de Werra and A. Hertz, Tabu search tehcniques: A tutorial and an application to neural networks, OR Spectrum (1989)131–141.",{"doi":1607},"10.1007\u002FBF01720782",{"id":26,"text":1609,"url":26,"identifiers":1610},"D. Whitley, T. Starkweather and D. Fuguay, Scheduling problems and traveling salesman: The genetic edge recombinition operator,Proc. 3rd Int. Conf. of Genetic Algorithms, Fairfax, VA (1989).",{},{"id":26,"text":1612,"url":26,"identifiers":1613},"D.L. Woodruff and E. Zemel, Hashing vectors for tabu search, Ann. Oper. Res. (1993), this volume.",{"doi":1614},"10.1007\u002FBF02022565",{"id":1616,"createTime":1617,"updateTime":1618,"relativeEntities":1619,"slug":1620,"properties":1621,"entityType":776,"verifyStatus":25,"verifyTime":1618,"verifyNote":777,"syncStatus":28,"languages":1632,"translateLanguages":26,"viewCount":36,"primaryUrl":1633,"fullTextUrl":26,"authors":1634,"publicationType":866,"publisherRelationship":1657,"citationCount":1691,"citationInfo":1692,"publishDate":1694,"publishYear":1695,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1696,"isForceReanalyzing":1096},"da42a9f1-2573-4f17-84f3-36089c07bdbe","2024-04-19T17:29:19.080+00:00","2024-12-08T10:46:02.873+00:00",[],"Dynamic-vehicle-routing-Status-and-prospects",{"mag":1622,"keywords":1624,"openalex":1625,"abstract":1627,"title":1628,"doi":1630},{"VOID":1623},"2079487902",{},{"VOID":1626},"W2079487902",{},{"EN":1629},"Dynamic vehicle routing: Status and prospects",{"VOID":1631},"10.1007\u002Fbf02098286",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02098286",[1635],{"id":1636,"sortIndex":36,"researcher":26,"roles":1637,"affiliations":1638,"properties":1650},"a6de2859-6773-4245-8fe4-362da034c8e4",[],[1639],{"id":1640,"sortIndex":36,"affiliation":1641,"properties":26},"992b694b-d22a-49e8-b30d-b75720b3d39c",{"id":1642,"createTime":1643,"updateTime":1644,"relativeEntities":1645,"slug":1646,"properties":1647,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"190ab26e-d4ce-4f8d-bd3d-6a3d12460b97","2024-01-10T06:15:10.450+00:00","2025-02-24T02:42:52.375+00:00",[],"National-Technical-University-of-Athens-Athens-Greece",{"title":1648},{"VI":1649},"National Technical University of Athens, Athens, Greece",{"openalex":1651,"orcid":1653,"title":1655},{"VOID":1652},"A5008565328",{"VOID":1654},"https:\u002F\u002Forcid.org\u002F0000-0003-1671-4406",{"EN":1656},"Harilaos N. Psaraftis",{"url":26,"publisher":1658,"properties":1685},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1659,"slug":663,"properties":1660,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1663,"manageAffiliations":1664,"indexDatabases":1665,"url":26,"thumbnailPath":26,"statistic":1680,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1661,"title":1662},{"VOID":666},{"EN":668},[],[],[1666,1673],{"id":729,"indexDatabase":1667,"url":744,"indexYears":26,"academicFieldIds":1672,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":1668,"label":1669,"description":1670,"key":740,"publicationTags":1671,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":1674,"url":722,"indexYears":723,"academicFieldIds":1679,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":1675,"label":1676,"description":1677,"key":719,"publicationTags":1678,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":1681,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":1682,"totalCitation":750,"totalCitationByYear":1683,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":1684,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":1686,"pages":1688,"issue":1690},{"VOID":1687},"61",{"VOID":1689},"143-164",{"VOID":901},462,{"total":1691,"publishYear":26,"statisticByYear":1693},{"2012":516,"2013":397,"2014":244,"2015":240,"2016":242,"2017":516,"2018":242,"2019":298,"2020":298,"2021":116,"2022":50,"2023":50,"2024":115},"1995-12-01",1995,[1697,1700,1704,1708,1711,1715,1719,1723,1726,1729,1733,1737,1740,1743,1746,1750,1754,1758,1762,1766,1769,1773,1777,1781,1784,1787,1790,1793,1796,1800,1803,1807,1810,1814,1818,1821,1825,1828,1832,1836,1840,1844,1847,1850,1854,1858,1862,1865,1868,1872,1876,1880,1883,1886,1889,1892,1896,1900],{"id":26,"text":1698,"url":26,"identifiers":1699},"A. Aslidis, Minimization of overstowage in containership operations,Operational Research '90, vol. 18 (1991) pp. 457–471.",{},{"id":26,"text":1701,"url":26,"identifiers":1702},"P.K. Bagchi and B.N. Nag, Dynamic vehicle scheduling: An expert systems approach, International Journal of Physical Distribution and Logistics 21(1991)10–18.",{"doi":1703},"10.1108\u002F09600039110134805",{"id":26,"text":1705,"url":26,"identifiers":1706},"W. Bell, L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Macj and P.J. Prutzman, Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces 13(1983)4–23.",{"doi":1707},"10.1287\u002Finte.13.6.4",{"id":26,"text":1709,"url":26,"identifiers":1710},"D.J. Bertsimas and D. Simchi-Levi, The new generation of vehicle routing research: Robust algorithms, addressing uncertainty, Working paper, MIT (1993).",{},{"id":26,"text":1712,"url":26,"identifiers":1713},"D.J. Bertsimas and G. van Ryzin, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research 39(1991)601–615.",{"doi":1714},"10.1287\u002Fopre.39.4.601",{"id":26,"text":1716,"url":26,"identifiers":1717},"D.J. Bertsimas and G. van Ryzin, Stochastic and dynamic vehicle routing with general demand and interarrival time distributions, Working paper, MIT (1992).",{"doi":1718},"10.2307\u002F1427801",{"id":26,"text":1720,"url":26,"identifiers":1721},"D.J. Bertsimas and G. van Ryzin, Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles, Operations Research 41(1993)60–76.",{"doi":1722},"10.1287\u002Fopre.41.1.60",{"id":26,"text":1724,"url":26,"identifiers":1725},"D. Bollo, P. Hanappe and M. Stumm, Le développement des pratiques EDI dans les transports, Recherche Transports Securité 38\u002F39(1993)128–136.",{},{"id":26,"text":1727,"url":26,"identifiers":1728},"D.E. Boyce, B. Ran and L.J. LeBlanc, Solving the dynamic user-optimal traffic assignment problem over congested transportation networks,TRISTAN Conference, Montreal, Quebec, Canada (1991).",{},{"id":26,"text":1730,"url":26,"identifiers":1731},"G.G. Brown, C.J. Ellis, G.W. Graves and D. Ronen, Real-time, wide area dispatching of mobil tank trucks, Interfaces 17(1987)107–120.",{"doi":1732},"10.1287\u002Finte.17.1.107",{"id":26,"text":1734,"url":26,"identifiers":1735},"K. Chen and R.D. Ervin, Intelligent vehicle-highway systems: US activities and policy issues, Technological Forecasting and Social Change 38(1990)363–374.",{"doi":1736},"10.1016\u002F0040-1625(90)90005-G",{"id":26,"text":1738,"url":26,"identifiers":1739},"T.G. Crainic, P. Dejax and M. Gendreau, Modeling the container fleet management problem using a stochastic programming approach,Operational Research '90, vol 18 (1991) pp. 473–486.",{},{"id":26,"text":1741,"url":26,"identifiers":1742},"The impact of EDI on transport, COST 320 Final Report, Commission of the European Communities, Directorate General for Transport (DGVII) (1992).",{},{"id":26,"text":1744,"url":26,"identifiers":1745},"M.S. Daskin and W.J. Hopp, Dynamic facility location modeling using forecast horizon concepts: Issues, algorithms, and results,TRISTAN Conference, Montreal, Quebec, Canada (1991).",{},{"id":26,"text":1747,"url":26,"identifiers":1748},"C.C. Deng, H.L. Ong, B.W. Ang and T.N. Goh, A modeling study of a taxi service operation, International Journal of Operations and Production Management 12(1992)65–78.",{"doi":1749},"10.1108\u002F01443579210017510",{"id":26,"text":1751,"url":26,"identifiers":1752},"M. Dror, M. Ball and B. Golden, A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research 4(1985)3–23.",{"doi":1753},"10.1007\u002FBF02022035",{"id":26,"text":1755,"url":26,"identifiers":1756},"M. Dror, G. Laporte and P. Trudeau, Vehicle routing with stochastic demands: Properties and solution frameworks, Transportation Science 23(1989)166–176.",{"doi":1757},"10.1287\u002Ftrsc.23.3.166",{"id":26,"text":1759,"url":26,"identifiers":1760},"M. Dror, G. Laporte and F.V. Louveaux, Vehicle routing with stochastic demands and restricted failures, ZOR — Methods and Models of Operations Research 37(1993)273–283.",{"doi":1761},"10.1007\u002FBF01415995",{"id":26,"text":1763,"url":26,"identifiers":1764},"M. Dror and W.B. Powell (eds.), Operations Research 41, special issue on Stochastic and Dynamic Models in Transportation (1993).",{"doi":1765},"10.1287\u002Fopre.41.1.11",{"id":26,"text":1767,"url":26,"identifiers":1768},"G. Fagan, Introduction to geographical information systems,Tutorial, TIMS\u002FORSA Meeting, Chicago, IL (1993).",{},{"id":26,"text":1770,"url":26,"identifiers":1771},"M.L. Fisher, J. Huang and B-X. Tang, Scheduling bulk pickup-delivery vehicles in Shanghai, Interfaces 16(1986)18–23.",{"doi":1772},"10.1287\u002Finte.16.2.18",{"id":26,"text":1774,"url":26,"identifiers":1775},"L.F. Frantzeskakis and W.B. Powell, A successive approximation procedure for stochastic, dynamic vehicle allocation problems, Transportation Science 24(1990)40–57.",{"doi":1776},"10.1287\u002Ftrsc.24.1.40",{"id":26,"text":1778,"url":26,"identifiers":1779},"T.L. Friesz, J. Luque, R.L. Tobin and B. Wie, Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research 37(1989)893–901.",{"doi":1780},"10.1287\u002Fopre.37.6.893",{"id":26,"text":1782,"url":26,"identifiers":1783},"M. Garmilla, Computer-aided routing of combination carriers, M.Sc. Thesis, Department of Ocean Engineering, MIT (1988).",{},{"id":26,"text":1785,"url":26,"identifiers":1786},"M. Gendreau, G. Laporte and R. Seguin, The vehicle routing problem with stochastic customers and demands, Publication CRT-873, Centre de Recherche sur les Transports, Université de Montréal, Canada (1992).",{},{"id":26,"text":1788,"url":26,"identifiers":1789},"ISL, Report on the SCUSY system (Simulation of container handling units), Institute of Shipping Economics and Logistics, Bremen, Germany (1992).",{},{"id":26,"text":1791,"url":26,"identifiers":1792},"P. Jaillet, The probabilistic traveling salesman problem, Ph.D. Thesis, Department of Civil Engineering, MIT (1985).",{},{"id":26,"text":1794,"url":26,"identifiers":1795},"P. Jaillet, Probabilistic routing problems in the plane,Operational Research '90, vol. 29, No. 10 (1991) pp. 675–688.",{},{"id":26,"text":1797,"url":26,"identifiers":1798},"R. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Mathematics of Operations Research 2(1977)209–224.",{"doi":1799},"10.1287\u002Fmoor.2.3.209",{"id":26,"text":1801,"url":26,"identifiers":1802},"R.M. Karp, On-line algorithms versus off-line algorithms: How much is it worth to know the future?,Tutorial, ORSA\u002FTIMS Meeting, Anaheim, CA (1991).",{},{"id":26,"text":1804,"url":26,"identifiers":1805},"L. Kleinrock, and H. Levy, The analysis of random polling systems, Operations Research 36(1988)716–732.",{"doi":1806},"10.1287\u002Fopre.36.5.716",{"id":26,"text":1808,"url":26,"identifiers":1809},"G. Laporte and F. Louveaux, Exact solution of some transportation problems under uncertainty,TRISTAN Conference, Montreal, Quebec, Canada (1991).",{},{"id":26,"text":1811,"url":26,"identifiers":1812},"G. Laporte and P.J. Dejax, Dynamic location-routing problems, Journal of the Operational Research Society 40(1989)471–482.",{"doi":1813},"10.1057\u002Fjors.1989.74",{"id":26,"text":1815,"url":26,"identifiers":1816},"G. Laporte, F. Louveaux and H. Mercure, The vehicle routing problem with stochastic travel times, Transportation Science 26(1992)161–170.",{"doi":1817},"10.1287\u002Ftrsc.26.3.161",{"id":26,"text":1819,"url":26,"identifiers":1820},"J. Lysgaard, Dynamic transportation networks in vehicle routing and scheduling, Interfaces 22(1992)44–55.",{},{"id":26,"text":1822,"url":26,"identifiers":1823},"V.A. Mabert, A.V. Hill and D.W. Montgomery, A decision support system for the courier vehicle scheduling problem, Omega 16(1988)333–345.",{"doi":1824},"10.1016\u002F0305-0483(88)90070-9",{"id":26,"text":1826,"url":26,"identifiers":1827},"C. Malandraki, Time-dependent vehicle routing problems: Formulations, solution algorithms and computational experience, Ph.D. Thesis, Department of Civil Engineering, Northwestern University (1990).",{},{"id":26,"text":1829,"url":26,"identifiers":1830},"C. Malandraki and M.S. Daskin, Time-dependent vehicle routing problems: Formulations, properties, and heuristic algorithms, Transportation Science 26(1992)185–200.",{"doi":1831},"10.1287\u002Ftrsc.26.3.185",{"id":26,"text":1833,"url":26,"identifiers":1834},"N. Megiddo, Dynamic location problems, Annals of Operations Research 6(1986)313–319.",{"doi":1835},"10.1007\u002FBF02044238",{"id":26,"text":1837,"url":26,"identifiers":1838},"H. Min, The multiple vehicle routing problem with simultaneous delivery and pickup points, Transportation Research 23A(1989)377–386.",{"doi":1839},"10.1016\u002F0191-2607(89)90085-X",{"id":26,"text":1841,"url":26,"identifiers":1842},"H. Min, International intermodal choices via chance-constrained programming, Transportation Research 25A(1991)351–362.",{"doi":1843},"10.1016\u002F0191-2607(91)90013-G",{"id":26,"text":1845,"url":26,"identifiers":1846},"C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map (extended abstract),Proc. ICALP (1989) pp. 611–620.",{},{"id":26,"text":1848,"url":26,"identifiers":1849},"G.H. Polychronopoulos, Stochastic and dynamic shortest distance problems, Ph.D. Thesis, Operations Research Center, MIT (1992).",{},{"id":26,"text":1851,"url":26,"identifiers":1852},"W.B. Powell, A stochastic model of the dynamic vehicle allocation problem, Transportation Science 20(1986)117–129.",{"doi":1853},"10.1287\u002Ftrsc.20.2.117",{"id":26,"text":1855,"url":26,"identifiers":1856},"H.N. Psaraftis, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science 14(1980)130–154.",{"doi":1857},"10.1287\u002Ftrsc.14.2.130",{"id":26,"text":1859,"url":26,"identifiers":1860},"H.N. Psaraftis, On the practical importance of asymptotic optimality in certain heuristic algorithms, Networks 4(1984)587–596.",{"doi":1861},"10.1002\u002Fnet.3230140409",{"id":26,"text":1863,"url":26,"identifiers":1864},"H.N. Psaraftis, J.B. Orlin, D. Bienstock and P.M. Thompson, Analysis and solution algorithms of sealift routing and scheduling problems: Final report, Working Paper No. 1700-85, Sloan School of Management, MIT (1985).",{},{"id":26,"text":1866,"url":26,"identifiers":1867},"H.N. Psaraftis, Dynamic Vehicle Routing Problems, in:Vehicle Routing: Methods and Studies, eds. B. Golden and A. Assad (North-Holland, 1988).",{},{"id":26,"text":1869,"url":26,"identifiers":1870},"H.N. Psaraftis and J.N. Tsitsiklis, Dynamic shortest paths in acyclic networks with Markovian arc costs, Operations Research 41(1993)91–101.",{"doi":1871},"10.1287\u002Fopre.41.1.91",{"id":26,"text":1873,"url":26,"identifiers":1874},"D. Ronen, Short term scheduling of vessels for shipping bulk or semi-bulk commodities originating in a single area, Operations Research 34(1986)164–173.",{"doi":1875},"10.1287\u002Fopre.34.1.164",{"id":26,"text":1877,"url":26,"identifiers":1878},"I. Sabuncuoglu and D. Hommertzheim, Dynamic dispatching algorithm for scheduling machines and sutomated guided vehicles in a flexible manufacturing system, International Journal of Production Research 30(1992)1059–1079.",{"doi":1879},"10.1080\u002F00207549208942943",{"id":26,"text":1881,"url":26,"identifiers":1882},"F. Soumis and A.R. Odoni, Dynamic ground-holding strategies for air traffic control,TRISTAN Conference, Montreal, Quebec, Canada (1991).",{},{"id":26,"text":1884,"url":26,"identifiers":1885},"V. Speidel, EDP-assisted fleet scheduling in tramp and coastal shipping, in:Ship Operation Automation, eds. Pitkin, Roche and Williams (North-Holland, 1976).",{},{"id":26,"text":1887,"url":26,"identifiers":1888},"Systemes Telematiques d' Interet General, Annual Technical Report on RTD: Transport Telematics, Commission of the European Communities, Directorate General for Information Technologies and Industries, and Telecommunications (DGXIII) (1993).",{},{"id":26,"text":1890,"url":26,"identifiers":1891},"H. Takagi, Analysis of polling systems with a mixture of exhaustive and gated service disciplines, Journal of the Operations Research Society of Japan 32(1989)450–461.",{},{"id":26,"text":1893,"url":26,"identifiers":1894},"P.M. Thompson and H.N. Psaraftis, Cyclic transfer algorithms for multivehicle routing and scheduling problems, Operations Research 41(1993)935–946.",{"doi":1895},"10.1287\u002Fopre.41.5.935",{"id":26,"text":1897,"url":26,"identifiers":1898},"P. Trudeau and M. Dror, Stochastic inventory routing: Route design with stockouts and route failures, Transportation Science 26(1992)171–184.",{"doi":1899},"10.1287\u002Ftrsc.26.3.171",{"id":26,"text":1901,"url":26,"identifiers":1902},"N.H.M. Wilson, J.M. Sussman, H.K. Hwang and B.T. Higonett, Scheduling algorithms for diala-ride systems, Urban Systems Laboratory Report USL TR-70-13, MIT (1971).",{},{"id":1904,"createTime":1905,"updateTime":1906,"relativeEntities":1907,"slug":1908,"properties":1909,"entityType":776,"verifyStatus":25,"verifyTime":1920,"verifyNote":777,"syncStatus":28,"languages":1921,"translateLanguages":26,"viewCount":36,"primaryUrl":1922,"fullTextUrl":26,"authors":1923,"publicationType":866,"publisherRelationship":1962,"citationCount":1996,"citationInfo":1997,"publishDate":1999,"publishYear":1179,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2000,"isForceReanalyzing":1096},"45308689-1dfa-490e-a5a7-2a0b12a68a3b","2024-04-18T08:57:07.574+00:00","2025-01-31T22:34:08.668+00:00",[],"Dynamical-systems-and-variational-inequalities",{"mag":1910,"keywords":1912,"openalex":1913,"abstract":1915,"title":1916,"doi":1918},{"VOID":1911},"2102739878",{},{"VOID":1914},"W2102739878",{},{"EN":1917},"Dynamical systems and variational inequalities",{"VOID":1919},"10.1007\u002Fbf02073589","2025-01-31T22:34:08.667+00:00",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02073589",[1924,1942],{"id":1925,"sortIndex":36,"researcher":26,"roles":1926,"affiliations":1927,"properties":1937},"bf4cdb39-4f12-49c5-9fab-41d60f29f99e",[],[1928],{"id":1929,"sortIndex":36,"affiliation":1930,"properties":26},"36d5de32-2be0-4a0b-a653-f347beadf97f",{"id":1931,"createTime":1932,"updateTime":1932,"relativeEntities":1933,"slug":26,"properties":1934,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7c3aa04e-63d8-4a88-be33-a1bf344748e5","2024-01-18T22:54:07.075+00:00",[],{"title":1935},{"VI":1936},"Lefschetz Center for Dynamical Systems, Division of Applied Mathematics, Brown University, Providence, USA",{"openalex":1938,"title":1940},{"VOID":1939},"A5010647194",{"EN":1941},"Paul Dupuis",{"id":1943,"sortIndex":115,"researcher":26,"roles":1944,"affiliations":1945,"properties":1955},"287d1758-5587-4c86-9064-150f58fe3d6a",[],[1946],{"id":1947,"sortIndex":36,"affiliation":1948,"properties":26},"1fdf8d0d-d1c0-4d37-a5aa-881154781d42",{"id":1949,"createTime":1950,"updateTime":1950,"relativeEntities":1951,"slug":26,"properties":1952,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"57899467-6e0e-4327-8bb7-b8ab9560bc5f","2024-02-05T13:47:17.039+00:00",[],{"title":1953},{"VI":1954},"School of Management, University of Massachusetts, Amherst, USA",{"openalex":1956,"orcid":1958,"title":1960},{"VOID":1957},"A5072294897",{"VOID":1959},"https:\u002F\u002Forcid.org\u002F0000-0002-1645-5363",{"EN":1961},"Anna Nagurney",{"url":26,"publisher":1963,"properties":1990},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1964,"slug":663,"properties":1965,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1968,"manageAffiliations":1969,"indexDatabases":1970,"url":26,"thumbnailPath":26,"statistic":1985,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1966,"title":1967},{"VOID":666},{"EN":668},[],[],[1971,1978],{"id":729,"indexDatabase":1972,"url":744,"indexYears":26,"academicFieldIds":1977,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":1973,"label":1974,"description":1975,"key":740,"publicationTags":1976,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":1979,"url":722,"indexYears":723,"academicFieldIds":1984,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":1980,"label":1981,"description":1982,"key":719,"publicationTags":1983,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":1986,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":1987,"totalCitation":750,"totalCitationByYear":1988,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":1989,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":1991,"pages":1993,"issue":1995},{"VOID":1992},"44",{"VOID":1994},"7-42",{"VOID":901},388,{"total":1996,"publishYear":26,"statisticByYear":1998},{"2012":173,"2013":173,"2014":516,"2015":516,"2016":237,"2017":53,"2018":173,"2019":50,"2020":298,"2021":50,"2022":173,"2023":234,"2024":114},"1993-02-01",[2001,2005,2008,2011,2014,2018,2021,2024,2028,2032,2036,2040,2044,2048,2052,2056,2060,2063,2067,2070,2074,2078,2082,2086,2089,2092,2095,2099,2103,2106,2110,2113,2117,2121,2125,2129,2133,2137,2141,2145,2149,2153,2157,2161,2165,2168],{"id":26,"text":2002,"url":26,"identifiers":2003},"J.P. Aubin and A. Cellina,Differential Inclusions (Springer, Berlin, 1984).",{"doi":2004},"10.1007\u002F978-3-642-69512-4",{"id":26,"text":2006,"url":26,"identifiers":2007},"M. Beckmann, C.B. McGuire and C.B. Winsten,Studies in the Economics of Transportation (Yale University Press, New Haven, CT, 1956).",{},{"id":26,"text":2009,"url":26,"identifiers":2010},"D. Bernstein, Programmability of continuous and discrete network equilibria, PhD Thesis, University of Pennsylvania, Philadelphia, PA (1990).",{},{"id":26,"text":2012,"url":26,"identifiers":2013},"P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).",{},{"id":26,"text":2015,"url":26,"identifiers":2016},"K.C. Border,Fixed Point Theorems with Applications to Economics and Game Theory (Cambridge University Press, Cambridge, England, 1985).",{"doi":2017},"10.1017\u002FCBO9780511625756",{"id":26,"text":2019,"url":26,"identifiers":2020},"E.A. Coddington and N. Levinson,Theory of Ordinary Differential Equations (McGraw-Hill, New York, 1955).",{},{"id":26,"text":2022,"url":26,"identifiers":2023},"A.A. Cournot,Researches into the Mathematical Principles of the Theory of Wealth (1838; English transl.: MacMillan, London, England, 1897).",{},{"id":26,"text":2025,"url":26,"identifiers":2026},"S. Dafermos, Traffic equilibrium and variational inequalities, Transp. Sci. 14 (1980) 42–54.",{"doi":2027},"10.1287\u002Ftrsc.14.1.42",{"id":26,"text":2029,"url":26,"identifiers":2030},"S. Dafermos, The general multimodal traffic equilibrium problem with elastic demand, Networks 12 (1982) 57–72.",{"doi":2031},"10.1002\u002Fnet.3230120105",{"id":26,"text":2033,"url":26,"identifiers":2034},"S. Dafermos, An iterative scheme for variational inequalities, Math. Progr. 26 (1983) 40–47.",{"doi":2035},"10.1007\u002FBF02591891",{"id":26,"text":2037,"url":26,"identifiers":2038},"S. Dafermos, Exchange price equilibria and variational inequalities, Math. Progr. 46 (1990) 391–402.",{"doi":2039},"10.1007\u002FBF01585753",{"id":26,"text":2041,"url":26,"identifiers":2042},"S. Dafermos and A. Nagurney, Oligopolistic and competitive behavior of spatially separated markets, Reg. Sci. Urban Econ. 17 (1987) 245–254.",{"doi":2043},"10.1016\u002F0166-0462(87)90048-2",{"id":26,"text":2045,"url":26,"identifiers":2046},"P. Dupuis, Large deviations analysis of reflected diffusions and constrained stochastic approximation algorithms in convex sets, Stochastics 21 (1987) 63–96.",{"doi":2047},"10.1080\u002F17442508708833451",{"id":26,"text":2049,"url":26,"identifiers":2050},"P. Dupuis and H. Ishii, On Lipschitz continuity of the solution mapping to the Skorokhod Problem, with applications, Stochastics and Stochastic Reports 35 (1991) 31–62.",{"doi":2051},"10.1080\u002F17442509108833688",{"id":26,"text":2053,"url":26,"identifiers":2054},"P. Dupuis and H. Ishii, SDEs with oblique reflection on nonsmooth domains, Ann. Prob. 21 (1993) 554–580.",{"doi":2055},"10.1214\u002Faop\u002F1176989415",{"id":26,"text":2057,"url":26,"identifiers":2058},"P. Dupuis and H.J. Kushner, Stochastic approximation and large deviations: Upper bounds and w.p. 1 convergence, SIAM J. Control Optim. 27 (1989) 1108–1135.",{"doi":2059},"10.1137\u002F0327059",{"id":26,"text":2061,"url":26,"identifiers":2062},"P. Dupuis and R.J. Williams, Lyapunov functions for semimartingale reflected Brownian motions, Lefschetz Center for Dynamical Systems, Report # 92-5, Brown University, Providence, RI (1992), to appear in: Ann. Prob.",{},{"id":26,"text":2064,"url":26,"identifiers":2065},"S.N. Ethier and T.G. Kurtz,Markov Processes: Characterization and Convergence (Wiley, New York, 1986).",{"doi":2066},"10.1002\u002F9780470316658",{"id":26,"text":2068,"url":26,"identifiers":2069},"A.N. Fillipov, Differential equations with discontinuous right-hand side, Mat. Sbornik (N.S.) 51 (1960) 99–128.",{},{"id":26,"text":2071,"url":26,"identifiers":2072},"S.D. Flam, Solving convex programs by means of ordinary differential equations, Math. Oper. Res. 17 (1992) 290–302.",{"doi":2073},"10.1287\u002Fmoor.17.2.290",{"id":26,"text":2075,"url":26,"identifiers":2076},"S.D. Flam and A. Ben-Israel, A continuous approach to oligopolistic market equilibrium, Oper. Res. 38 (1990) 1045–1051.",{"doi":2077},"10.1287\u002Fopre.38.6.1045",{"id":26,"text":2079,"url":26,"identifiers":2080},"M. Florian and M. Los, A new look at static spatial price equilibrium problems, Reg. Sci. Urban Econ. 12 (1982), 579–597.",{"doi":2081},"10.1016\u002F0166-0462(82)90008-4",{"id":26,"text":2083,"url":26,"identifiers":2084},"M.I. Freidlin and A.D. Wentzell,Random Perturbations of Dynamical Systems (Springer, New York, 1984).",{"doi":2085},"10.1007\u002F978-1-4684-0176-9",{"id":26,"text":2087,"url":26,"identifiers":2088},"D. Gabay and H. Moulin, On the uniqueness and stability of Nash equilibria in noncooperative games, in:Applied Stochastic Control of Econometrics and Management Science, eds. A. Bensoussan, P. Kleindorfer and C.S. Tapiero (North-Holland, Amsterdam, The Netherlands, 1980).",{},{"id":26,"text":2090,"url":26,"identifiers":2091},"C.B. Garcia and W.I. Zangwill,Pathways to Solutions, Fixed Points, and Equilibria (Prentice-Hall, Englewood Cliffs, NJ, 1981).",{},{"id":26,"text":2093,"url":26,"identifiers":2094},"P. Hartman,Ordinary Differential Equations (Wiley, New York, 1964).",{},{"id":26,"text":2096,"url":26,"identifiers":2097},"P. Hartman and G. Stampacchia, On some nonlinear elliptical differential functional equations, Acta Math. 115 (1966) 271–310.",{"doi":2098},"10.1007\u002FBF02392210",{"id":26,"text":2100,"url":26,"identifiers":2101},"A. Haurie and P. Marcotte, On the relationship between Nash-Cournot and Wardrop equilibria, Networks 15 (1985) 295–308.",{"doi":2102},"10.1002\u002Fnet.3230150303",{"id":26,"text":2104,"url":26,"identifiers":2105},"D. Kinderlehrer and G. Stampacchia,An Introduction to Variational Inequalities and Their Applications (Academic Press, New York, 1980).",{},{"id":26,"text":2107,"url":26,"identifiers":2108},"H.J. Kushner and D.S. Clark,Stochastic Approximation Methods for Constrained and Unconstrained Systems (Springer, New York, 1978).",{"doi":2109},"10.1007\u002F978-1-4684-9352-8",{"id":26,"text":2111,"url":26,"identifiers":2112},"S. Lefschetz,Differential Equations. Geometric Theory (Interscience, New York, 1957).",{},{"id":26,"text":2114,"url":26,"identifiers":2115},"A. Mas-Colell,The Theory of General Economic Equilibrium. A Differential Approach (Cambridge University Press, Cambridge, England, 1985).",{"doi":2116},"10.1017\u002FCCOL0521265142",{"id":26,"text":2118,"url":26,"identifiers":2119},"A. Nagurney, Migration equilibrium and variational inequalities, Econ. Lett. 31 (1989) 109–112.",{"doi":2120},"10.1016\u002F0165-1765(89)90122-5",{"id":26,"text":2122,"url":26,"identifiers":2123},"A. Nagurney,Network Economics: A Variational Inequality Approach (Kluwer Academic, Boston, MA, 1993).",{"doi":2124},"10.1007\u002F978-94-011-2178-1",{"id":26,"text":2126,"url":26,"identifiers":2127},"A. Nagurney, J. Dong and M. Hughes, The formulation and computation of general financial equilibrium, Optimization 26 (1992) 339–354.",{"doi":2128},"10.1080\u002F02331939208843862",{"id":26,"text":2130,"url":26,"identifiers":2131},"J.F. Nash, Equilibrium points inn-person games, Proc. National Acad. Sci. 36 (1950) 48–49.",{"doi":2132},"10.1073\u002Fpnas.36.1.48",{"id":26,"text":2134,"url":26,"identifiers":2135},"J.F. Nash, Noncooperative games, Ann. Math. 54 (1951) 286–298.",{"doi":2136},"10.2307\u002F1969529",{"id":26,"text":2138,"url":26,"identifiers":2139},"K. Okuguchi,Expectations and Stability in Oligopoly Models, Lecture Notes in Economics and Mathematical Systems 138 (Springer, Berlin, 1976).",{"doi":2140},"10.1007\u002F978-3-642-46347-1",{"id":26,"text":2142,"url":26,"identifiers":2143},"K. Okuguchi, The Cournot oligopoly and competitive equilibrium as solutions to non-linear complementarity problems, Econ. Lett. 12 (1983) 127–133.",{"doi":2144},"10.1016\u002F0165-1765(83)90123-4",{"id":26,"text":2146,"url":26,"identifiers":2147},"K. Okuguchi and F. Szikdarovsky,The Theory of Oligopoly with Multi-Product Firms, Lecture Notes in Economics and Mathematical Systems 342 (Springer, Berlin, 1990).",{"doi":2148},"10.1007\u002F978-3-662-02622-9",{"id":26,"text":2150,"url":26,"identifiers":2151},"P.A. Samuelson, The stability of equilibrium: Comparative statics and dynamics, Econometrica 9 (1941) 97–120.",{"doi":2152},"10.2307\u002F1906872",{"id":26,"text":2154,"url":26,"identifiers":2155},"A.V. Skorokhod, Stochastic equations for diffusions in a bounded region, Theory Prob. Appl. 6 (1961) 264–274.",{"doi":2156},"10.1137\u002F1106035",{"id":26,"text":2158,"url":26,"identifiers":2159},"S. Smale, A convergence process of price adjustment and global Newton methods, J. Math. Econ. 3 (1976) 107–120.",{"doi":2160},"10.1016\u002F0304-4068(76)90019-7",{"id":26,"text":2162,"url":26,"identifiers":2163},"M.J. Smith, The existence and calculation of traffic equilibria, Transp. Res. 17B (1983) 291–303.",{"doi":2164},"10.1016\u002F0191-2615(83)90047-4",{"id":26,"text":2166,"url":26,"identifiers":2167},"H.R. Varian, Dynamical systems with applications to economics, in:Handbook of Mathematical Economics 1, eds. K.J. Arrow and M.D. Intrilligator (North-Holland, Amsterdam, The Netherlands, 1981) pp. 93–110.",{},{"id":26,"text":2169,"url":26,"identifiers":2170},"L.T. Watson, Solving the nonlinear complementarity problem by a homotopy method, SIAM J. Control Optim. 17 (1979) 36–46.",{"doi":2171},"10.1137\u002F0317004",{"id":2173,"createTime":2174,"updateTime":2175,"relativeEntities":2176,"slug":2177,"properties":2178,"entityType":776,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":2189,"translateLanguages":26,"viewCount":36,"primaryUrl":2190,"fullTextUrl":26,"authors":2191,"publicationType":866,"publisherRelationship":2228,"citationCount":2256,"citationInfo":2257,"publishDate":2259,"publishYear":2260,"citationAnalyzeStatus":1453,"lastCitationAnalyze":2175,"indexDatabases":26,"openAccess":26,"references":2261,"isForceReanalyzing":1096},"00f02f81-5aa6-46e8-bece-aca2853c0a97","2024-04-11T20:18:28.374+00:00","2024-04-12T00:22:15.151+00:00",[],"Robust-Asset-Allocation",{"mag":2179,"keywords":2181,"openalex":2182,"abstract":2184,"title":2185,"doi":2187},{"VOID":2180},"2033500977",{},{"VOID":2183},"W2033500977",{},{"EN":2186},"Robust Asset Allocation",{"VOID":2188},"10.1023\u002Fb:anor.0000045281.41041.ed",[102],"http:\u002F\u002Flink.springer.com\u002F10.1023\u002FB:ANOR.0000045281.41041.ed",[2192,2210],{"id":2193,"sortIndex":115,"researcher":26,"roles":2194,"affiliations":2195,"properties":2205},"dddd4488-f101-4133-9338-ad5761dd7d0f",[],[2196],{"id":26,"sortIndex":36,"affiliation":2197,"properties":26},{"id":2198,"createTime":2199,"updateTime":2199,"relativeEntities":2200,"slug":2201,"properties":2202,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7ff38d62-aebe-4b2b-bfbe-6e41d37891e0","2024-04-11T20:18:29.018+00:00",[],"Quantitative-Analysis-National-City-Investment-Management-Company-Cleveland-USA",{"title":2203},{"EN":2204},"Quantitative Analysis, National City Investment Management Company, Cleveland, USA",{"openalex":2206,"title":2208},{"VOID":2207},"A5019445095",{"EN":2209},"Michael A. Koenig",{"id":2211,"sortIndex":36,"researcher":26,"roles":2212,"affiliations":2213,"properties":2223},"6bc9df16-a613-44e9-9428-39a42cd3053d",[],[2214],{"id":26,"sortIndex":36,"affiliation":2215,"properties":26},{"id":2216,"createTime":2217,"updateTime":2217,"relativeEntities":2218,"slug":2219,"properties":2220,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"239da1a7-5d8b-4690-8c5c-ceafd0223693","2024-04-11T20:18:28.741+00:00",[],"Dept-of-Mathematical-Sciences-Carnegie-Mellon-University-Pittsburgh-USA",{"title":2221},{"EN":2222},"Dept. of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, USA",{"openalex":2224,"title":2226},{"VOID":2225},"A5022502434",{"EN":2227},"Reha Tütüncü",{"url":26,"publisher":2229,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2230,"slug":663,"properties":2231,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2234,"manageAffiliations":2235,"indexDatabases":2236,"url":26,"thumbnailPath":26,"statistic":2251,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2232,"title":2233},{"VOID":666},{"EN":668},[],[],[2237,2244],{"id":729,"indexDatabase":2238,"url":744,"indexYears":26,"academicFieldIds":2243,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":2239,"label":2240,"description":2241,"key":740,"publicationTags":2242,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":2245,"url":722,"indexYears":723,"academicFieldIds":2250,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":2246,"label":2247,"description":2248,"key":719,"publicationTags":2249,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":2252,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":2253,"totalCitation":750,"totalCitationByYear":2254,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":2255,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},340,{"total":2256,"publishYear":26,"statisticByYear":2258},{"2012":241,"2013":239,"2014":237,"2015":234,"2016":238,"2017":241,"2018":298,"2019":103,"2020":287,"2021":241,"2022":103,"2023":103,"2024":114},"2004-11-01",2004,[],{"id":2263,"createTime":2264,"updateTime":2265,"relativeEntities":2266,"slug":2267,"properties":2268,"entityType":776,"verifyStatus":25,"verifyTime":2265,"verifyNote":777,"syncStatus":28,"languages":2279,"translateLanguages":26,"viewCount":36,"primaryUrl":2280,"fullTextUrl":26,"authors":2281,"publicationType":866,"publisherRelationship":2318,"citationCount":122,"citationInfo":2352,"publishDate":2354,"publishYear":2355,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2356,"isForceReanalyzing":1096},"d7c05feb-e131-43ec-ac52-53089b152c9a","2024-04-20T05:07:52.030+00:00","2025-02-12T01:41:05.408+00:00",[],"Simulated-annealing-metaheuristics-for-the-vehicle-routing-problem-with-time-windows",{"mag":2269,"keywords":2271,"openalex":2272,"abstract":2274,"title":2275,"doi":2277},{"VOID":2270},"2014412090",{},{"VOID":2273},"W2014412090",{},{"EN":2276},"Simulated annealing metaheuristics for the vehicle routing problem with time windows",{"VOID":2278},"10.1007\u002Fbf02601637",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02601637",[2282,2303],{"id":2283,"sortIndex":115,"researcher":26,"roles":2284,"affiliations":2285,"properties":2296},"cd0b3c3c-cfa0-4090-b98b-5f6c8e85e882",[],[2286],{"id":2287,"sortIndex":36,"affiliation":2288,"properties":26},"2646edf5-49e4-42c4-be30-7927977515df",{"id":2289,"createTime":2290,"updateTime":2290,"relativeEntities":2291,"slug":2292,"properties":2293,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b99e360f-b0f8-4ade-9b5a-309d9d12de46","2024-04-20T05:07:52.052+00:00",[],"Department-of-Quantitative-Methods-University-of-Tulsa-74014-Tulsa-OK-USA",{"title":2294},{"EN":2295},"Department of Quantitative Methods, University of Tulsa, 74014, Tulsa, OK, USA",{"openalex":2297,"orcid":2299,"title":2301},{"VOID":2298},"A5051316058",{"VOID":2300},"https:\u002F\u002Forcid.org\u002F0000-0002-6819-8194",{"EN":2302},"Robert A. Russell",{"id":2304,"sortIndex":36,"researcher":26,"roles":2305,"affiliations":2306,"properties":2313},"627c00e6-8efa-410f-8259-898264d93d0e",[],[2307],{"id":2308,"sortIndex":36,"affiliation":2309,"properties":26},"0f0e8bc4-020f-4a81-8a51-17a3286b8d55",{"id":2289,"createTime":2290,"updateTime":2290,"relativeEntities":2310,"slug":2292,"properties":2311,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2312},{"EN":2295},{"openalex":2314,"title":2316},{"VOID":2315},"A5046681211",{"EN":2317},"Wen‐Chyuan Chiang",{"url":26,"publisher":2319,"properties":2346},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2320,"slug":663,"properties":2321,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2324,"manageAffiliations":2325,"indexDatabases":2326,"url":26,"thumbnailPath":26,"statistic":2341,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2322,"title":2323},{"VOID":666},{"EN":668},[],[],[2327,2334],{"id":729,"indexDatabase":2328,"url":744,"indexYears":26,"academicFieldIds":2333,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":2329,"label":2330,"description":2331,"key":740,"publicationTags":2332,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":2335,"url":722,"indexYears":723,"academicFieldIds":2340,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":2336,"label":2337,"description":2338,"key":719,"publicationTags":2339,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":2342,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":2343,"totalCitation":750,"totalCitationByYear":2344,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":2345,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":2347,"pages":2349,"issue":2351},{"VOID":2348},"63",{"VOID":2350},"3-27",{"VOID":901},{"total":122,"publishYear":26,"statisticByYear":2353},{"2012":173,"2013":298,"2014":336,"2015":241,"2016":298,"2017":158,"2018":50,"2019":51,"2020":239,"2021":173,"2022":356,"2023":298,"2024":114},"1996-02-01",1996,[2357,2360,2364,2368,2372,2376,2380,2383,2387,2390,2394,2397,2400,2404,2407,2410,2413,2417,2421,2424,2427,2431,2435,2439,2442,2446,2449,2452,2456,2460,2464,2468,2472,2476,2479,2482,2485,2488,2491,2494],{"id":26,"text":2358,"url":26,"identifiers":2359},"E. Baker and J. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints, Amer. J. Math. Manag. Sci. 6 (1986) 261–300.",{},{"id":26,"text":2361,"url":26,"identifiers":2362},"E. Bonomi and J.L. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, Euro. J. Oper. Res. 26 (1986) 295–300.",{"doi":2363},"10.1016\u002F0377-2217(86)90193-1",{"id":26,"text":2365,"url":26,"identifiers":2366},"V. Cerny, Thermodynamic approach to the traveling salesman problem, J. Optim. Theory Appl. 45 (1985) 41–51.",{"doi":2367},"10.1007\u002FBF00940812",{"id":26,"text":2369,"url":26,"identifiers":2370},"D.T. Connolly, An improved annealing scheme for the QAP, Euro. J. Opér. Res. 46 (1990) 93–100.",{"doi":2371},"10.1016\u002F0377-2217(90)90301-Q",{"id":26,"text":2373,"url":26,"identifiers":2374},"N. Christofides and J. Beasley, The period routing problem, Networks 14 (1984) 237–246.",{"doi":2375},"10.1002\u002Fnet.3230140205",{"id":26,"text":2377,"url":26,"identifiers":2378},"M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40 (1992) 342–354.",{"doi":2379},"10.1287\u002Fopre.40.2.342",{"id":26,"text":2381,"url":26,"identifiers":2382},"M. Desrochers, J.K. Lenstra, J.K. Savelsberg and F. Soumis, Vehicle routing with time windows: Optimization and approximation, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad. (North-Holland, Amsterdam, 1988), pp. 65–84.",{},{"id":26,"text":2384,"url":26,"identifiers":2385},"M. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981) 109–124.",{"doi":2386},"10.1002\u002Fnet.3230110205",{"id":26,"text":2388,"url":26,"identifiers":2389},"M. Fisher K.O. Jörnsten and O.B.G. Madsen, Vehicle routing with time windows, Research Report 4C\u002F1991, IMSOR, Technical University of Denmark, DK-2800 Lyngby, Denmark (1991).",{},{"id":26,"text":2391,"url":26,"identifiers":2392},"T. Friesz, H.-J. Cho, N. Mehta, R. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transp. Sci. 26 (1992) 18–26.",{"doi":2393},"10.1287\u002Ftrsc.26.1.18",{"id":26,"text":2395,"url":26,"identifiers":2396},"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 5 (1986) 533–549.",{"doi":1501},{"id":26,"text":2398,"url":26,"identifiers":2399},"F. Glover, Tabu search, Part 1, ORSA J. Comp. 1 (1990) 190–206.",{"doi":1236},{"id":26,"text":2401,"url":26,"identifiers":2402},"F. Glover, Tabu search: A tutorial, Interfaces 20 (1990) 74–94.",{"doi":2403},"10.1287\u002Finte.20.4.74",{"id":26,"text":2405,"url":26,"identifiers":2406},"F. Glover, Tabu search, Part 2, ORSA J. Comp. 2 (1991) 4–32.",{"doi":1240},{"id":26,"text":2408,"url":26,"identifiers":2409},"F. Glover and M.M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (1993) pp. 70–150.",{},{"id":26,"text":2411,"url":26,"identifiers":2412},"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper Res. 40 (1993) 3–30.",{},{"id":26,"text":2414,"url":26,"identifiers":2415},"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part I, Graph partitioning, Oper. Res. 37 (1989) 865–892.",{"doi":2416},"10.1287\u002Fopre.37.6.865",{"id":26,"text":2418,"url":26,"identifiers":2419},"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning, Oper. Res. 39 (1991) 378–406.",{"doi":2420},"10.1287\u002Fopre.39.3.378",{"id":26,"text":2422,"url":26,"identifiers":2423},"S. Kirkpatrick, D.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.",{"doi":1262},{"id":26,"text":2425,"url":26,"identifiers":2426},"G. Kontoravdis and J. Bard, Improved heuristics for the vehicle routing problems with time windows, Working Paper, Operations Research Group, The University of Texas at Austin (1992).",{},{"id":26,"text":2428,"url":26,"identifiers":2429},"Y.A. Koskosidis, W.B. Powell and M.M. Solomon, An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transp. Sci. 26 (1992) 69–85.",{"doi":2430},"10.1287\u002Ftrsc.26.2.69",{"id":26,"text":2432,"url":26,"identifiers":2433},"M.M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Manag. Sci. 39 (1993) 492–500.",{"doi":2434},"10.1287\u002Fmnsc.39.4.492",{"id":26,"text":2436,"url":26,"identifiers":2437},"H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problems, Ann. Oper. Res. 21 (1989) 85–108.",{"doi":2438},"10.1007\u002FBF02022094",{"id":26,"text":2440,"url":26,"identifiers":2441},"H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper, Graduate School of Business, University of Texas at Austin (1987).",{},{"id":26,"text":2443,"url":26,"identifiers":2444},"N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculation by fast computing machines, J. Chem. Phys. 21 (1953) 1087–1091.",{"doi":2445},"10.1063\u002F1.1699114",{"id":26,"text":2447,"url":26,"identifiers":2448},"I. Or, Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University (1976).",{},{"id":26,"text":2450,"url":26,"identifiers":2451},"I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Ann. Oper. Res. 40 (1993) 421–452.",{"doi":1574},{"id":26,"text":2453,"url":26,"identifiers":2454},"J.Y. Potvin and J.M. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, Euro. J. Oper. Res. 66 (1993) 331–340.",{"doi":2455},"10.1016\u002F0377-2217(93)90221-8",{"id":26,"text":2457,"url":26,"identifiers":2458},"R. Russell, An effective heuristic for theM-tour traveling salesman problem with some side conditions, Oper. Res. 25 (1977) 517–524.",{"doi":2459},"10.1287\u002Fopre.25.3.517",{"id":26,"text":2461,"url":26,"identifiers":2462},"R. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transp. Sci. 29 (1995) 156–166.",{"doi":2463},"10.1287\u002Ftrsc.29.2.156",{"id":26,"text":2465,"url":26,"identifiers":2466},"M. Savelsbergh, Local search in routing problems with time windows, Ann. Oper. Res. 4 (1985) 285–305.",{"doi":2467},"10.1007\u002FBF02022044",{"id":26,"text":2469,"url":26,"identifiers":2470},"M. Solomon, Algorithms for the vehicle routing and cheduling problem with time window constraints, Oper. Res. 35 (1987) 254–265.",{"doi":2471},"10.1287\u002Fopre.35.2.254",{"id":26,"text":2473,"url":26,"identifiers":2474},"M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems, Transp. Sci. 22 (1988) 1–13.",{"doi":2475},"10.1287\u002Ftrsc.22.1.1",{"id":26,"text":2477,"url":26,"identifiers":2478},"M.M. Solomon, E.K. Baker and J.R. Schaffer, Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures, in:Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1985), pp. 85–105.",{},{"id":26,"text":2480,"url":26,"identifiers":2481},"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp 17 (1991) 443–455.",{"doi":1600},{"id":26,"text":2483,"url":26,"identifiers":2484},"S.R. Thangiah, K.E. Nygard and P.L. Juell, GIDEON: A genetic algorithm system for vehicle routing problems with time windows,Proc. 7th IEEE Conf. on Artificial Intelligence Applications, Miami, FL (1991).",{},{"id":26,"text":2486,"url":26,"identifiers":2487},"S.R. Thangiah, I.H. Osman and T. Sun, Hybrid genetic algorithms, simulated annealing and tabu search methods for the vehicle routing problem with time windows (1994).",{},{"id":26,"text":2489,"url":26,"identifiers":2490},"P.M. Thompson and H. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Oper. Res. 41 (1993) 935–946.",{"doi":1895},{"id":26,"text":2492,"url":26,"identifiers":2493},"P.J.M. van Laarhoven and E.H. Aarts,Simulated Annealing: Theory and Applications, (Reidel, Dordrecht, 1987).",{"doi":1330},{"id":26,"text":2495,"url":26,"identifiers":2496},"M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, IEEE Trans. 19 (1987) 107–119.",{"doi":2497},"10.1080\u002F07408178708975376",{"id":2499,"createTime":2500,"updateTime":2500,"relativeEntities":2501,"slug":2502,"properties":2503,"entityType":776,"verifyStatus":25,"verifyTime":2500,"verifyNote":777,"syncStatus":28,"languages":2514,"translateLanguages":26,"viewCount":36,"primaryUrl":2515,"fullTextUrl":26,"authors":2516,"publicationType":866,"publisherRelationship":2612,"citationCount":2647,"citationInfo":2648,"publishDate":2650,"publishYear":2651,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2652,"isForceReanalyzing":1096},"7dd4a316-05ba-479b-bf87-a15906de6e50","2024-09-05T13:15:09.799+00:00",[],"Transforming-business-using-digital-innovations-the-application-of-AI-blockchain-cloud-and-data-analytics",{"mag":2504,"keywords":2506,"openalex":2507,"abstract":2509,"title":2510,"doi":2512},{"VOID":2505},"3023793582",{},{"VOID":2508},"W3023793582",{},{"EN":2511},"Transforming business using digital innovations: the application of AI, blockchain, cloud and data analytics",{"VOID":2513},"10.1007\u002Fs10479-020-03620-w",[102],"https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10479-020-03620-w",[2517,2538,2559,2580,2595],{"id":2518,"sortIndex":115,"researcher":26,"roles":2519,"affiliations":2520,"properties":2531},"678f9e6c-71a8-4e26-8132-f108ad787b51",[],[2521],{"id":2522,"sortIndex":36,"affiliation":2523,"properties":26},"2f5742bf-a184-411d-baba-5596f9c9df71",{"id":2524,"createTime":2525,"updateTime":2525,"relativeEntities":2526,"slug":2527,"properties":2528,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"1d73862a-0a54-49cc-b41a-1bed84638a63","2024-09-05T13:15:09.846+00:00",[],"School-for-the-Future-of-Innovation-in-Society-Arizona-State-University-Tempe-85287-5603-USA",{"title":2529},{"EN":2530},"School for the Future of Innovation in Society, Arizona State University, Tempe, 85287-5603, USA",{"openalex":2532,"orcid":2534,"title":2536},{"VOID":2533},"A5052796632",{"VOID":2535},"https:\u002F\u002Forcid.org\u002F0000-0003-3118-5557",{"EN":2537},"Katina Michael",{"id":2539,"sortIndex":111,"researcher":26,"roles":2540,"affiliations":2541,"properties":2552},"2bd6dbda-86da-46e8-ba1e-147c47df5ae7",[],[2542],{"id":2543,"sortIndex":36,"affiliation":2544,"properties":26},"7c3b634f-784f-4a07-bfcc-39a39162a8d9",{"id":2545,"createTime":2546,"updateTime":2546,"relativeEntities":2547,"slug":2548,"properties":2549,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"2bea59da-bb10-4422-bd88-15cc30f29b33","2024-09-05T13:15:09.889+00:00",[],"Lincoln-International-Business-School-University-of-Lincoln-Lincoln-LN5-7AT-UK",{"title":2550},{"EN":2551},"Lincoln International Business School, University of Lincoln, Lincoln, LN5 7AT, UK",{"openalex":2553,"orcid":2555,"title":2557},{"VOID":2554},"A5091046239",{"VOID":2556},"https:\u002F\u002Forcid.org\u002F0000-0002-3386-9613",{"EN":2558},"Mahfuzur Rahman",{"id":2560,"sortIndex":59,"researcher":26,"roles":2561,"affiliations":2562,"properties":2573},"b26e9650-2a97-43c6-b8ba-4b51399e9f3b",[],[2563],{"id":2564,"sortIndex":36,"affiliation":2565,"properties":26},"d48e176a-94bd-43bc-afd9-e32b85072641",{"id":2566,"createTime":2567,"updateTime":2567,"relativeEntities":2568,"slug":2569,"properties":2570,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"74f63a5a-dd74-476e-979d-75f21d128ed0","2024-09-05T13:15:09.822+00:00",[],"Sydney-Business-School-University-of-Wollongong-Sydney-NSW-2000-Australia",{"title":2571},{"EN":2572},"Sydney Business School, University of Wollongong, Sydney, NSW, 2000, Australia",{"openalex":2574,"orcid":2576,"title":2578},{"VOID":2575},"A5089204700",{"VOID":2577},"https:\u002F\u002Forcid.org\u002F0000-0002-3040-2815",{"EN":2579},"Grace McCarthy",{"id":2581,"sortIndex":114,"researcher":26,"roles":2582,"affiliations":2583,"properties":2590},"518738d6-721c-4066-903e-dfdeaa7f9db2",[],[2584],{"id":2585,"sortIndex":36,"affiliation":2586,"properties":26},"a95a16c4-fc0b-443d-9c98-576121df462d",{"id":2566,"createTime":2567,"updateTime":2567,"relativeEntities":2587,"slug":2569,"properties":2588,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2589},{"EN":2572},{"openalex":2591,"title":2593},{"VOID":2592},"A5086426946",{"EN":2594},"Muhammad Rajib Uddin",{"id":2596,"sortIndex":36,"researcher":26,"roles":2597,"affiliations":2598,"properties":2605},"0d01cbdf-921e-4f07-84a9-adab99273b89",[],[2599],{"id":2600,"sortIndex":36,"affiliation":2601,"properties":26},"1401324a-d0b6-4648-b964-56896f574d52",{"id":2566,"createTime":2567,"updateTime":2567,"relativeEntities":2602,"slug":2569,"properties":2603,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2604},{"EN":2572},{"openalex":2606,"orcid":2608,"title":2610},{"VOID":2607},"A5017644589",{"VOID":2609},"https:\u002F\u002Forcid.org\u002F0000-0002-2050-9985",{"EN":2611},"Shahriar Akter",{"url":26,"publisher":2613,"properties":2640},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2614,"slug":663,"properties":2615,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2618,"manageAffiliations":2619,"indexDatabases":2620,"url":26,"thumbnailPath":26,"statistic":2635,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2616,"title":2617},{"VOID":666},{"EN":668},[],[],[2621,2628],{"id":729,"indexDatabase":2622,"url":744,"indexYears":26,"academicFieldIds":2627,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":2623,"label":2624,"description":2625,"key":740,"publicationTags":2626,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":2629,"url":722,"indexYears":723,"academicFieldIds":2634,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":2630,"label":2631,"description":2632,"key":719,"publicationTags":2633,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":2636,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":2637,"totalCitation":750,"totalCitationByYear":2638,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":2639,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":2641,"pages":2643,"issue":2645},{"VOID":2642},"308",{"VOID":2644},"7-39",{"VOID":2646},"1-2",303,{"total":2647,"publishYear":26,"statisticByYear":2649},{"2020":50,"2021":608,"2022":534,"2023":357,"2024":346},"2022-01-01",2022,[2653,2656,2660,2664,2667,2670,2673,2676,2680,2683,2687,2691,2695,2698,2701,2705,2708,2712,2716,2719,2722,2726,2730,2734,2737,2741,2745,2749,2752,2755,2759,2762,2765,2768,2772,2775,2779,2782,2785,2788,2791,2795,2799,2802,2805,2808,2811,2815,2819,2822,2825,2828,2832,2835,2838,2842,2846,2850,2853,2856,2860,2864,2867,2871,2874,2878,2882,2885,2889,2893,2897,2900,2904,2908,2912,2915,2919,2923,2926,2930,2933,2936,2940,2943,2946,2950,2954,2957,2961,2964,2968,2972,2976,2979,2983,2987,2990,2994,2997,3000,3003,3006,3009,3012,3016,3020,3023,3027,3030,3033,3037,3041,3044,3048,3052,3055,3058,3062,3065,3068,3071,3075,3079,3083,3087,3091,3094,3097,3101,3105,3109,3113,3117,3120,3123,3126,3130,3134,3137,3140,3143,3146,3149,3153,3157],{"id":26,"text":2654,"url":26,"identifiers":2655},"Afiniti. (2018). What we do. Retrieved February 1, 2020 from https:\u002F\u002Fwww.afiniti.com.",{},{"id":26,"text":2657,"url":26,"identifiers":2658},"Akter, S., Bandara, R., Hani, U., Wamba, S. F., Foropon, C., & Papadopoulos, T. (2019). Analytics-based decision-making for service systems: A qualitative study and agenda for future research. International Journal of Information Management, 48(2019), 85–95.",{"doi":2659},"10.1016\u002Fj.ijinfomgt.2019.01.020",{"id":26,"text":2661,"url":26,"identifiers":2662},"Akter, S., & Wamba, S. F. (2016). Big data analytics in E-commerce: A systematic review and agenda for future research. Electronic Markets, 26(2), 173–194.",{"doi":2663},"10.1007\u002Fs12525-016-0219-0",{"id":26,"text":2665,"url":26,"identifiers":2666},"Aleksandrova, M. (2019). Big data in the banking industry: The main challenges and use cases. Retrieved January 31, 2020 from https:\u002F\u002Feasternpeak.com\u002Fblog\u002Fbig-data-in-the-banking-industry-the-main-challenges-and-use-cases\u002F.",{},{"id":26,"text":2668,"url":26,"identifiers":2669},"Almorsy, M., Grundy, J., & Müller, I. (2016). An analysis of the cloud computing security problem. arXiv preprint arXiv:1609.01107.",{},{"id":26,"text":2671,"url":26,"identifiers":2672},"Alphabeta Advisors. (2018). Digital innovation: Australia’s $315b opportunity. Retrieved February 1, 2020 from https:\u002F\u002Fdata61.csiro.au\u002Fen\u002FOur-Research\u002FOur-Work\u002FFuture-Cities\u002FPlanning-sustainable-infrastructure\u002FDigital-Innovation.",{},{"id":26,"text":2674,"url":26,"identifiers":2675},"Amazon. (2020). At Capital One, enhancing fraud protection with machine learning. Retrieved February 08 from https:\u002F\u002Faws.amazon.com\u002Fmachine-learning\u002Fcustomers\u002Finnovators\u002Fcapital_one\u002F.",{},{"id":26,"text":2677,"url":26,"identifiers":2678},"Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R., Konwinski, A., et al. (2010). A view of cloud computing. Communications of the ACM, 53(4), 50–58.",{"doi":2679},"10.1145\u002F1721654.1721672",{"id":26,"text":2681,"url":26,"identifiers":2682},"Arora, M., Chopra, A. B., & Dixit, V. S. (2020). An Approach to secure collaborative recommender system using artificial intelligence, deep learning, and blockchain. In S. Choudhury, R. Mishra, & A. Kumar (Eds.), Intelligent communication, control and devices (Vol. 989). Advances in Intelligent Systems and Computing. Singapore: Springer.",{},{"id":26,"text":2684,"url":26,"identifiers":2685},"Ashwell, M. L. (2017). The digital transformation of intelligence analysis. Journal of Financial Crime, 24(3), 393–411.",{"doi":2686},"10.1108\u002FJFC-03-2017-0020",{"id":26,"text":2688,"url":26,"identifiers":2689},"Avram, M. G. (2014). Advantages and challenges of adopting cloud computing from an enterprise perspective. Procedia Technology, 12, 529–534.",{"doi":2690},"10.1016\u002Fj.protcy.2013.12.525",{"id":26,"text":2692,"url":26,"identifiers":2693},"Barney, J. (1991). Firm resources and sustained competitive advantage. Journal of Management, 17, 99–120.",{"doi":2694},"10.1177\u002F014920639101700108",{"id":26,"text":2696,"url":26,"identifiers":2697},"Basilico, J., & Amatrian, X. (2012). Netflix recommendations Beyond the 5 starts The Netflix Tech Blog. Retrieved February 1, 2020 from https:\u002F\u002Fnetflixtechblog.com\u002Fnetflix-recommendations-beyond-the-5-stars-part-1-55838468f429.",{},{"id":26,"text":2699,"url":26,"identifiers":2700},"Basilico, J., & Amatrian,X (2013). System Architectures for Personalization and Recommendation. The Netflix tech Blog. Retrieved February 1, 2020 from https:\u002F\u002Fnetflixtechblog.com\u002Fsystem-architectures-for-personalization-and-recommendation-e081aa94b5d8.",{},{"id":26,"text":2702,"url":26,"identifiers":2703},"Basole, R. C. (2016). Accelerating digital transformation: Visual insights from the API ecosystem. IT Professional, 18, 20–25.",{"doi":2704},"10.1109\u002FMITP.2016.105",{"id":26,"text":2706,"url":26,"identifiers":2707},"Batra, G., Queirolo, A., & Santhanam, N. (2018). Artificial intelligence: The time to act is now. McKinsey, January. Retrieved February 10, 2020 from https:\u002F\u002Fwww.mckinsey.com\u002Findustries\u002Fadvanced-electronics\u002Four-insights\u002Fartificial-intelligence-the-time-to-act-is-now.",{},{"id":26,"text":2709,"url":26,"identifiers":2710},"Battisti, E., Shams, S., Sakka, G., & Miglietta, N. (2019). Big data and risk management in business processes: Implications for corporate real estate. Business Process Management Journal. https:\u002F\u002Fdoi.org\u002F10.1108\u002FBPMJ-03-2019-0125.",{"doi":2711},"10.1108\u002FBPMJ-03-2019-0125",{"id":26,"text":2713,"url":26,"identifiers":2714},"Battleson, D. A., West, B. C., Kim, J., Ramesh, B., & Robinson, P. S. (2016). Achieving dynamic capabilities with cloud computing: An empirical investigation. European Journal of Information Systems, 25(3), 209–230.",{"doi":2715},"10.1057\u002Fejis.2015.12",{"id":26,"text":2717,"url":26,"identifiers":2718},"Beall, A. (2020). Big data in health care: How three organizations are using big data to improve patient care and more? Retrieved February 11, 2020 from https:\u002F\u002Fwww.sas.com\u002Fen_gb\u002Finsights\u002Farticles\u002Fbig-data\u002Fbig-data-in-healthcare.html.",{},{"id":26,"text":2720,"url":26,"identifiers":2721},"Bengio, Y. (2013). Deep learning of representations: Looking forward. In A. H Dediu, C. Martín-Vide, R. Mitkov, & B. Truthe (Eds.), International conference on statistical language and speech processing (Vol. 7978). SLSP 2013, Lecture Notes in Computer Science. Berlin: Springer.",{},{"id":26,"text":2723,"url":26,"identifiers":2724},"Benlian, A., Kettinger, W. J., Sunyaev, A., Winkler, T. J., & Guest, E. (2018). Special section: The transformative value of cloud computing: A decoupling, platformization, and recombination theoretical framework. Journal of Management Information Systems, 35(3), 719–739. https:\u002F\u002Fdoi.org\u002F10.1080\u002F07421222.2018.1481634.",{"doi":2725},"10.1080\u002F07421222.2018.1481634",{"id":26,"text":2727,"url":26,"identifiers":2728},"Berman, S. J. (2012). Digital transformation: Opportunities to create new business models. Strategy & Leadership, 40, 16–24.",{"doi":2729},"10.1108\u002F10878571211209314",{"id":26,"text":2731,"url":26,"identifiers":2732},"Bhushan, K., & Gupta, B. (2018). Detecting DDoS attack using software defined network (SDN) in cloud computing environment. Paper presented at the 2018 5th International Conference on Signal Processing and Integrated Networks (SPIN).",{"doi":2733},"10.1109\u002FSPIN.2018.8474062",{"id":26,"text":2735,"url":26,"identifiers":2736},"Bo, K. S. (2018). Cloud computing for business. International Journal of Advances in Scientific Research and Engineering, 4(7), 156–160.",{},{"id":26,"text":2738,"url":26,"identifiers":2739},"Botta, A., De Donato, W., Persico, V., & Pescapé, A. (2016). Integration of cloud computing and internet of things: A survey. Future Generation Computer Systems, 56, 684–700.",{"doi":2740},"10.1016\u002Fj.future.2015.09.021",{"id":26,"text":2742,"url":26,"identifiers":2743},"Camilleri, M. A. (2019). The use of data-driven technologies for customer-centric marketing. International Journal of Big Data Management (forthcoming).",{"doi":2744},"10.2139\u002Fssrn.3382746",{"id":26,"text":2746,"url":26,"identifiers":2747},"Cao, Q., Schniederjans, D. G., & Schniederjans, M. (2017). Establishing the use of cloud computing in supply chain management. Operations Management Research, 10(1–2), 47–63.",{"doi":2748},"10.1007\u002Fs12063-017-0123-6",{"id":26,"text":2750,"url":26,"identifiers":2751},"Carpenter, J. (2015). IBM’s Virginia Rometty tells NU grads: Technology will enhance us. Retrieved February 11, 2019 from https:\u002F\u002Fwww.chicagotribune.com\u002Fbluesky\u002Foriginals\u002Fct-northwestern-virginiarometty-ibm-bsi-20150619-story.html.",{},{"id":26,"text":2753,"url":26,"identifiers":2754},"Carson, B., Romanelli, G., Walsh, P., & Zhumaev, A. (2018). Blockchain beyond the hype: What is the strategic business value (pp. 1–13). McKinsey & Company.",{},{"id":26,"text":2756,"url":26,"identifiers":2757},"Chen, H., Chiang, R. H. L., & Storey, V. C. (2012). Business intelligence and analytics: From big data to big impact. MIS Quarterly, 36(4), 1165–1188.",{"doi":2758},"10.2307\u002F41703503",{"id":26,"text":2760,"url":26,"identifiers":2761},"Chui, M. (2017). Artificial intelligence the next digital frontier? (Vol. 47). McKinsey and Company Global Institute.",{},{"id":26,"text":2763,"url":26,"identifiers":2764},"Cohen, J. S. G. (2017). Warding off the threat of disruption. MIT Sloan Management Review, 58(2), 95–96.",{},{"id":26,"text":2766,"url":26,"identifiers":2767},"Cohen, P. R., & Feigenbaum, E. A. (2014). The handbook of artificial intelligence. London: Butterworth-Heinemann.",{},{"id":26,"text":2769,"url":26,"identifiers":2770},"Cowen, D., Johnston, K. A., & Vuke, K. (2016). How cloud computing influences business strategy within South African enterprise (p. 272). IEEE.",{"doi":2771},"10.1109\u002FEmergiTech.2016.7737351",{"id":26,"text":2773,"url":26,"identifiers":2774},"Crosby, M., Pattanayak, P., Verma, S., & Kalyanaraman, V. (2016). Blockchain technology: Beyond bitcoin. Applied Innovation, 2, 6–10.",{},{"id":26,"text":2776,"url":26,"identifiers":2777},"Davenport, T. H. (2014). Big data at work. Boston, MA: Harvard Business School Publishing.",{"doi":2778},"10.15358\u002F9783800648153",{"id":26,"text":2780,"url":26,"identifiers":2781},"Davenport, T. H. (2018). Can we solve AI’s ‘trust problem’? MIT Sloan Management Review, November 02. Retrieved January 30, 2020 from https:\u002F\u002Fsloanreview.mit.edu\u002Farticle\u002Fcan-we-solve-ais-trust-problem\u002F.",{},{"id":26,"text":2783,"url":26,"identifiers":2784},"Davenport, T. H., & Ronanki, R. (2018). Artificial intelligence for the real world. Harvard Business Review, 96(1), 108–116.",{},{"id":26,"text":2786,"url":26,"identifiers":2787},"Davenport, T. H., & Spanyi, A. (2019). Digital transformation should start with customers. https:\u002F\u002Fsloanreview.mit.edu\u002Farticle\u002Fdigital-transformation-should-start-with-customers\u002F. Accessed 31 Jan 2020.",{},{"id":26,"text":2789,"url":26,"identifiers":2790},"Deep Instinct. (2018). How deep learning works. Retrieved February 1, 2020 from https:\u002F\u002Fwww.deepinstinct.com.",{},{"id":26,"text":2792,"url":26,"identifiers":2793},"Delone, W. H. (2003). The DeLone and McLean model of information systems success: A ten-year update. Journal of Management Information Systems, 19, 9–30.",{"doi":2794},"10.1080\u002F07421222.2003.11045748",{"id":26,"text":2796,"url":26,"identifiers":2797},"DeLone, W. H., & McLean, E. R. (1992). Information systems success: The quest for the dependent variable. Information Systems Research, 3, 60–95.",{"doi":2798},"10.1287\u002Fisre.3.1.60",{"id":26,"text":2800,"url":26,"identifiers":2801},"Dixon, M. (2019). How Netflix used big data and analytics to generate billions. https:\u002F\u002Fseleritysas.com\u002Fblog\u002F2019\u002F04\u002F05\u002Fhow-netflix-used-big-data-and-analytics-to-generate-billions\u002F. Accessed 31 Jan 2020.",{},{"id":26,"text":2803,"url":26,"identifiers":2804},"Doniz, S. (2018). Qantas Airways uses Microsoft 365 to better connect airline personnel and people on the move. Retrieved February 1, 2020 from https:\u002F\u002Fcustomers.microsoft.com\u002Fen-us\u002Fstory\u002Fqantas-travel-and-transportation-microsoft-365.",{},{"id":26,"text":2806,"url":26,"identifiers":2807},"Dremel, C., Wulf, J., Herterich, M. M., Waizmann, J.-C., & Brenner, W. (2017). How AUDI AG established big data analytics in its digital transformation. MIS Quarterly Executive, 16(2), 81–100.",{},{"id":26,"text":2809,"url":26,"identifiers":2810},"Duff, C. (2020). Microsoft earnings up as cloud business continues its expansion. Retrieved on January 29, 2020 from https:\u002F\u002Famp-cnn-com.cdn.ampproject.org\u002Fc\u002Fs\u002Famp.cnn.com\u002Fcnn\u002F2020\u002F01\u002F29\u002Ftech\u002Fmicrosoft-azure-earnings\u002Findex.html?fbclid=IwAR0tJxgH5W-P5pmihOWDwziLhQkIgoy3DyKIvP5HDZeaGuQ2LwRbBFBgFWU.",{},{"id":26,"text":2812,"url":26,"identifiers":2813},"Dumbill, E. (2013). Making sense of big data. Big Data, 1(1), 1–2.",{"doi":2814},"10.1089\u002Fbig.2012.1503",{"id":26,"text":2816,"url":26,"identifiers":2817},"Dunphy, P., & Petitcolas, F. A. (2018). A first look at identity management schemes on the blockchain. arXiv preprint arXiv:1801.03294.",{"doi":2818},"10.1109\u002FMSP.2018.3111247",{"id":26,"text":2820,"url":26,"identifiers":2821},"Ekramifard, A., Amintoosi, H., Seno, A. H., Dehghantanha, A., & Parizi, R. M. (2020). A systematic literature review of integration of blockchain and artificial intelligence. In K. K. Choo, A. Dehghantanha, & R. Parizi (Eds.), Blockchain cybersecurity, trust and privacy (Vol. 79). Advances in Information Security. Cham: Springer.",{},{"id":26,"text":2823,"url":26,"identifiers":2824},"Elmes, S. (2019). Delicious Data: How big data is disrupting the business of food. https:\u002F\u002Fadimo.co\u002Fnews\u002Fdelicious-data-how-big-data-is-disrupting-the-business-of-food. Accessed Jan 31 2020.",{},{"id":26,"text":2826,"url":26,"identifiers":2827},"Fargo, W., & ANZ. (2016). Distributed ledger technology and opportunities in correspondent banking. Retrieved February 1, 2020 from https:\u002F\u002Fwww.finextra.com\u002Ffinextra-downloads\u002Fnewsdocs\u002Fanz_wellsfargo_dlt_paper_hires.pdf?utm_content=buffer8a07c&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer.",{},{"id":26,"text":2829,"url":26,"identifiers":2830},"Feinleib, D. (2014). Big data bootcamp: What managers need to know to profit from the big data revolution. New York, NY: Apress Media Inc.",{"doi":2831},"10.1007\u002F978-1-4842-0040-7",{"id":26,"text":2833,"url":26,"identifiers":2834},"Forsythe, J., Rogan, C., Dimkin, D., Strain, R., Curran, J., & Odhav, V. (2016). Australia can see further by standing on the shoulders of giants. Driving digital transformation by adopting ‘Meaningful Use’ legislation. PWC Australia. Retereived April 24, 2020, from https:\u002F\u002Fwww.pwc.com.au\u002Fpublications\u002Fpdf\u002Fdigital-hospital-2016.pdf.",{},{"id":26,"text":2836,"url":26,"identifiers":2837},"Gartner. (2019). Blockchain potential and pitfalls. December, 05. Retrieved January 30, 2020 from https:\u002F\u002Fwww.gartner.com\u002Fen\u002Fwebinars\u002F3878710\u002Fblockchain-potential-and-pitfalls.",{},{"id":26,"text":2839,"url":26,"identifiers":2840},"Gill, S. S., Tuli, S., Xu, M., Singh, I., Singh, K. V., Lindsay, D., … Jain, U. J. I. O. T. (2019). Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges. 100118.",{"doi":2841},"10.1016\u002Fj.iot.2019.100118",{"id":26,"text":2843,"url":26,"identifiers":2844},"Gobble, M. M. (2013). Big data: The next big thing in innovation. Research-technology management, 56(1), 64–67.",{"doi":2845},"10.5437\u002F08956308X5601005",{"id":26,"text":2847,"url":26,"identifiers":2848},"Gölzer, P., & Fritzsche, A. (2017). Data-driven operations management: Organisational implications of the digital transformation in industrial practice. Production Planning & Control, 28(16), 1332–1343.",{"doi":2849},"10.1080\u002F09537287.2017.1375148",{"id":26,"text":2851,"url":26,"identifiers":2852},"Goodwin, T. (2015). The battle is for the customer interface. Retrieved February 11, 2020 from https:\u002F\u002Ftechcrunch.com\u002F2015\u002F03\u002F03\u002Fin-the-age-of-disintermediation-the-battle-is-all-for-the-customer-interface\u002F.",{},{"id":26,"text":2854,"url":26,"identifiers":2855},"Gray, K. (2017). AI can be a troublesome teammate. Harvard Business Review, July 20. Retrieved February 11, 2020 from https:\u002F\u002Fhbr.org\u002F2017\u002F07\u002Fai-can-be-a-troublesome-teammate.",{},{"id":26,"text":2857,"url":26,"identifiers":2858},"Grewal, D., Hulland, J., & Kopalle, P. K. (2020). The future of technology and marketing: A multidisciplinary perspective. Journal of the Academy of Marketing Science, 48, 1–8.",{"doi":2859},"10.1007\u002Fs11747-019-00711-4",{"id":26,"text":2861,"url":26,"identifiers":2862},"Gubbi, J., Buyya, R., Marusic, S., & Palaniswami, M. (2013). Internet of Thing: A vision, architectural elements and future directions. Future Generation Computer Systems, 29(70), 1645–1660.",{"doi":2863},"10.1016\u002Fj.future.2013.01.010",{"id":26,"text":2865,"url":26,"identifiers":2866},"Guido, P. (2014). Three companies that transformed their businesses using cloud computing. IBM BRANDVOICE. Retrieved February 1, 2020 from https:\u002F\u002Fwww.forbes.com\u002Fsites\u002Fibm\u002F2014\u002F11\u002F03\u002Fthree-companies-that-transformed-their-businesses-using-cloud-computing\u002F#204b715a1b66.",{},{"id":26,"text":2868,"url":26,"identifiers":2869},"Haggerty, E. (2017). Healthcare and digital transformation. Network Security, 2017(8), 7–11.",{"doi":2870},"10.1016\u002FS1353-4858(17)30081-8",{"id":26,"text":2872,"url":26,"identifiers":2873},"Hartmann, B., King, W. P., & Narayanan, S. (2015). Digital manufacturing: The revolution will be virtualized. Retrieved February 1, 2020 https:\u002F\u002Fwww.mckinsey.com\u002Fbusiness-functions\u002Foperations\u002Four-insights\u002Fdigital-manufacturing-the-revolution-will-be-virtualized.",{},{"id":26,"text":2875,"url":26,"identifiers":2876},"Heaton, J. B., Polson, N. G., & Witte, J. H. (2017). Deep learning for finance: Deep portfolios. Applied Stochastic Models in Business and Industry, 33(1), 3–12.",{"doi":2877},"10.1002\u002Fasmb.2209",{"id":26,"text":2879,"url":26,"identifiers":2880},"Heilig, L., Lalla-Ruiz, E., & Voß, S. (2017). Digital transformation in maritime ports: Analysis and a game theoretic framework. Netnomics: Economic Research and Electronic Networking, 18(2–3), 227–254.",{"doi":2881},"10.1007\u002Fs11066-017-9122-x",{"id":26,"text":2883,"url":26,"identifiers":2884},"Iansiti, M., & Lakhani, K. R. (2017). The truth about blockchain. Harvard Business Review, 95(1), 118–127.",{},{"id":26,"text":2886,"url":26,"identifiers":2887},"Ionescu, L. (2019). Big data, blockchain, and artificial intelligence in cloud-based accounting information systems. Analysis & Metaphysics, 18, 44–49.",{"doi":2888},"10.22381\u002FAM1820196",{"id":26,"text":2890,"url":26,"identifiers":2891},"Kasemsap, K. (2015). The role of cloud computing in global supply chain. In Enterprise management strategies in the era of cloud computing (pp. 192–219).: IGI Global.",{"doi":2892},"10.4018\u002F978-1-4666-8339-6.ch009",{"id":26,"text":2894,"url":26,"identifiers":2895},"Kathuria, A., Mann, A., Khuntia, J., Saldanha, T. J., & Kauffman, R. J. (2018). A strategic value appropriation path for cloud computing. Journal of Management Information Systems, 35(3), 740–775.",{"doi":2896},"10.1080\u002F07421222.2018.1481635",{"id":26,"text":2898,"url":26,"identifiers":2899},"Kirkland, R., & Tapscott, D. (2016). How blockchains could change the world. McKinsey Q, 3, 110–113.",{},{"id":26,"text":2901,"url":26,"identifiers":2902},"Kopetz, H. (2011). Real-time systems: Design principles for distributed embedded applications. Wien: Springer.",{"doi":2903},"10.1007\u002F978-1-4419-8237-7",{"id":26,"text":2905,"url":26,"identifiers":2906},"Kumar, V., Ramachandran, D., & Kumar, B. (2020). Influence of new-age technologies on marketing: A research agenda. Journal of Business Research. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.jbusres.2020.01.007.",{"doi":2907},"10.1016\u002Fj.jbusres.2020.01.007",{"id":26,"text":2909,"url":26,"identifiers":2910},"Kushida, K. E., Murray, J., & Zysman, J. (2015). Cloud computing: From scarcity to abundance. Journal of Industry, Competition and Trade, 15(1), 5–19.",{"doi":2911},"10.1007\u002Fs10842-014-0188-y",{"id":26,"text":2913,"url":26,"identifiers":2914},"Larson, K. (2019). Data privacy and AI ethics stepped to the fore in 2018. Retrieved February 11 from https:\u002F\u002Fmedium.com\u002F@Smalltofeds\u002Fdata-privacy-and-ai-ethics-stepped-to-the-fore-in-2018-4e0207f28210.",{},{"id":26,"text":2916,"url":26,"identifiers":2917},"LeCun, Y., Bengio, Y., & Hinton, G. (2015). Deep learning. Nature, 521, 436.",{"doi":2918},"10.1038\u002Fnature14539",{"id":26,"text":2920,"url":26,"identifiers":2921},"Lemley, J., Bazrafkan, S., & Corcoran, P. (2017). Deep learning for consumer devices and services: Pushing the limits for machine learning, artificial intelligence, and computer vision. IEEE Consumer Electronics Magazine, 6, 48–56.",{"doi":2922},"10.1109\u002FMCE.2016.2640698",{"id":26,"text":2924,"url":26,"identifiers":2925},"Li, F. (2018). The digital transformation of business models in the creative industries: A holistic framework and emerging trends. Technovation.",{},{"id":26,"text":2927,"url":26,"identifiers":2928},"Lim, S., Tucker, C. S., & Kumara, S. (2017). An unsupervised machine learning model for discovering latent infectious diseases using social media data. Journal of Biomedical Informatics, 66, 82–94.",{"doi":2929},"10.1016\u002Fj.jbi.2016.12.007",{"id":26,"text":2931,"url":26,"identifiers":2932},"Manyika, J., Chui, M., Lund, S., & Ramaswamy, S. (2017). What’s now and next in analytics, AI, and automation (pp. 1–12). McKinsey Global Institute.",{},{"id":26,"text":2934,"url":26,"identifiers":2935},"Markets & Markets. (2019). Artificial Intelligence Market worth $190.61 billion by 2025 with a Growing CAGR of 36.6%, June, 18. Retrieved January 30, 2020 from https:\u002F\u002Fwww.marketsandmarkets.com\u002FPressReleases\u002Fartificial-intelligence.asp%20.asp.",{},{"id":26,"text":2937,"url":26,"identifiers":2938},"Marković, D. S., Branović, I., & Popović, R. (2014). Review of cloud computing in business. Singidunum Journal of Applied Sciences. https:\u002F\u002Fdoi.org\u002F10.15308\u002FSInteZa-2014-673-677.",{"doi":2939},"10.15308\u002FSInteZa-2014-673-677",{"id":26,"text":2941,"url":26,"identifiers":2942},"Martin, J.-F. (2017). Unlocking success in digital transformations. McKinsey & Company (October), 1–14.",{},{"id":26,"text":2944,"url":26,"identifiers":2945},"McDonald, C. (2016). How InterContinental Hotels connects with real-time marketing. Retrieved February 1, 2020 from https:\u002F\u002Fwww.computerweekly.com\u002Fnews\u002F450403246\u002FHow-InterContinental-Hotels-connects-with-real-time-marketing.",{},{"id":26,"text":2947,"url":26,"identifiers":2948},"McGettigan, T. (2016). Artificial intelligence: Is Watson the real thing? (2016). Available at SSRN: https:\u002F\u002Fssrn.com\u002Fabstract=2826047 or http:\u002F\u002Fdx.doi.org\u002F10.2139\u002Fssrn.2826047.",{"doi":2949},"10.2139\u002Fssrn.2826047",{"id":26,"text":2951,"url":26,"identifiers":2952},"Melville, N., Kraemer, K., & Gurbaxani, V. (2004). Review: Information technology and organizational performance: An integrative model of it business value. MIS Quarterly, 28, 283–322.",{"doi":2953},"10.2307\u002F25148636",{"id":26,"text":2955,"url":26,"identifiers":2956},"Metz, C. (2018). Mark Zuckerberg, Elon musk and the feud over killer robots. Retrieved February 11, 2019 from https:\u002F\u002Fwww.nytimes.com\u002F2018\u002F06\u002F09\u002Ftechnology\u002Felon-musk-mark-zuckerberg-artificialintelligence.html.",{},{"id":26,"text":2958,"url":26,"identifiers":2959},"Michael, K., & Miller, K. W. (2013). Big data: New opportunities and new challenges. Computer, 46(6), 22–24.",{"doi":2960},"10.1109\u002FMC.2013.196",{"id":26,"text":2962,"url":26,"identifiers":2963},"Michelman, P. (2017). Seeing beyond the Blockchain Hype. MIT Sloan Management Review, 58(Summer issue), 17–19.",{},{"id":26,"text":2965,"url":26,"identifiers":2966},"Mills, D., Wang, K., Malone, B., Ravi, A., Marquardt, J., Chen, C., et al. (2016). Distributed ledger technology in payments, clearing, and settlement. Finance and Economics DiscussionSeries 2016-095. Washington: Board of Governors of the Federal Reserve System. https:\u002F\u002Fdoi.org\u002F10.17016\u002FFEDS.2016.095.",{"doi":2967},"10.17016\u002FFEDS.2016.095",{"id":26,"text":2969,"url":26,"identifiers":2970},"Monroe, D. (2017). Deep learning takes on translation. Communications of the ACM, 60(6), 12–14. https:\u002F\u002Fdoi.org\u002F10.1145\u002F3077229.",{"doi":2971},"10.1145\u002F3077229",{"id":26,"text":2973,"url":26,"identifiers":2974},"Morabito, V. (2015). Big data and analytics: Strategic and organizational impacts. Cham: Springer.",{"doi":2975},"10.1007\u002F978-3-319-10665-6",{"id":26,"text":2977,"url":26,"identifiers":2978},"Murphy, M. (2015). DHL: How a logistics firm evolved to provide ‘software as a service’. Computerworld UK from IDG. Retrieved April 27, 2020, from https:\u002F\u002Fdzone.com\u002Farticles\u002Fbest-news-saas-week-march-25.",{},{"id":26,"text":2980,"url":26,"identifiers":2981},"Nadeem, A., Abedin, B., Cerpa, N., & Chew, E. (2018). Digital transformation & digital business strategy in electronic commerce-the role of organizational capabilities. Journal of Theoretical and Applied Electronic Commerce Research, 13(2), 1–8.",{"doi":2982},"10.4067\u002FS0718-18762018000200101",{"id":26,"text":2984,"url":26,"identifiers":2985},"Najafabadi, M. M., Villanustre, F., Khoshgoftaar, T. M., Seliya, N., Wald, R., & Muharemagic, E. (2015). Deep learning applications and challenges in big data analytics. Journal of Big Data, 2, 1.",{"doi":2986},"10.1186\u002Fs40537-014-0007-7",{"id":26,"text":2988,"url":26,"identifiers":2989},"Narayen, S. (2018). Key words for digital transformation\u002Finterviewer: P. Michelman. @mitsmr.",{},{"id":26,"text":2991,"url":26,"identifiers":2992},"Necula, S.-C. (2017). Deep learning for distribution channels’ management. Informatica Economica, 21(4), 73–85. https:\u002F\u002Fdoi.org\u002F10.12948\u002Fissn14531305\u002F21.4.2017.06.",{"doi":2993},"10.12948\u002Fissn14531305\u002F21.4.2017.06",{"id":26,"text":2995,"url":26,"identifiers":2996},"NewVantage Partners. (2019). Big data and AI Executive Survey 2019. January 01. Retrieved January 30, 2020 from http:\u002F\u002Fnewvantage.com\u002Fwp-content\u002Fuploads\u002F2018\u002F12\u002FBig-Data-Executive-Survey-2019-Findings-122718.pdf.",{},{"id":26,"text":2998,"url":26,"identifiers":2999},"Nilsson, N. J. (2014). Principles of artificial intelligence. Los Altos, CA: Morgan Kaufmann.",{},{"id":26,"text":3001,"url":26,"identifiers":3002},"O’Neal, T. (2018). The future of cloud computing in 2019. December 21. Retrieved from https:\u002F\u002Fwww.techradar.com\u002Fau\u002Fnews\u002Fthe-future-of-cloud-computing-in-2019.",{},{"id":26,"text":3004,"url":26,"identifiers":3005},"Oana, O., Cosmin, T., & Valentin, N. C. (2017). Artificial intelligence—A new field of computer science which any business should consider. Ovidius University Annals, Economic Sciences Series, 17, 356–360.",{},{"id":26,"text":3007,"url":26,"identifiers":3008},"Ohlhorst, F. (2013). Big data analytics: Turning big data into big money. Hoboken, NJ: Wiley.",{},{"id":26,"text":3010,"url":26,"identifiers":3011},"Orcutt, M. (2019). Once hailed as unhackable, blockchains are now getting hacked. Retrieved February 10 from https:\u002F\u002Fwww.technologyreview.com\u002Fs\u002F612974\u002Fonce-hailed-as-unhackable-blockchains-are-now-getting-hacked\u002F.",{},{"id":26,"text":3013,"url":26,"identifiers":3014},"Orlikowski, W. J. (2007). Sociomaterial practices: Exploring technology at work. Organization Studies, 28, 1435–1448.",{"doi":3015},"10.1177\u002F0170840607081138",{"id":26,"text":3017,"url":26,"identifiers":3018},"Perlich, C., Dalessandro, B., Raeder, T., Stitelman, O., & Provost, F. (2014). Machine learning for targeted display advertising: Transfer learning in action. Machine Learning, 95(1), 103–127.",{"doi":3019},"10.1007\u002Fs10994-013-5375-2",{"id":26,"text":3021,"url":26,"identifiers":3022},"Porter, M. E., & Millar, V. E. (1985). How information gives you competitive advantage. Harvard Business Review, 63, 149–160. Reprint: Service.",{},{"id":26,"text":3024,"url":26,"identifiers":3025},"Rai, A. (2020). Explainable AI: From black box to glass box. Journal of the Academy of Marketing Science, 48(1), 137–141.",{"doi":3026},"10.1007\u002Fs11747-019-00710-5",{"id":26,"text":3028,"url":26,"identifiers":3029},"Ransbotham, S., Kiron, D., & Reeves, M. (2017). Shaping business with artificial intelligence. Closing the Gap Between Ambition and Action. MIT Sloan Management Review. Retrieved February 1, 2020 from https:\u002F\u002Fsloanreview.mit.edu\u002Fprojects\u002Freshaping-business-with-artificial-intelligence\u002F?gclid=Cj0KCQiA4NTxBRDxARIsAHyp6gBlfEktUysnFLRqnD7LB9__73MFvg9WBZrnU5CKpNwoV01Xe-Vind4aAkPjEALw_wcB.",{},{"id":26,"text":3031,"url":26,"identifiers":3032},"Re, R. M., & Solow-Niederman, A. (2019). Developing artificially intelligent justice (May 19, 2019). 22 Stanford Technology Law Review 242 (2019); UCLA School of Law, Public Law Research Paper No. 19-16. Available at SSRN: https:\u002F\u002Fssrn.com\u002Fabstract=3390854.",{},{"id":26,"text":3034,"url":26,"identifiers":3035},"Reddy, S., & Reinartz, W. (2017). Digital transformation and value creation: Sea change ahead. GfK Marketing Intelligence Review, 9(1), 10.",{"doi":3036},"10.1515\u002Fgfkmir-2017-0002",{"id":26,"text":3038,"url":26,"identifiers":3039},"Sabi, H. M., Uzoka, F.-M. E., Langmia, K., & Njeh, F. N. (2016). Conceptualizing a model for adoption of cloud computing in education. International Journal of Information Management, 36(2), 183–191.",{"doi":3040},"10.1016\u002Fj.ijinfomgt.2015.11.010",{"id":26,"text":3042,"url":26,"identifiers":3043},"Sathi, A. (2012). Big data analytics: Disruptive technologies for changing the game. Boise. IBM Corporation., ID: MC Press.",{},{"id":26,"text":3045,"url":26,"identifiers":3046},"Schweer, D., & Sahl, J. C. (2017). The digital transformation of industry—the benefit for Germany. In A. Abolhassan (Ed.), The drivers of digital transformation (pp. 23–31). Cham: Springer.",{"doi":3047},"10.1007\u002F978-3-319-31824-0_3",{"id":26,"text":3049,"url":26,"identifiers":3050},"Schwertner, K. (2017). Digital transformation of business. Trakia Journal of Sciences, 15(1), 388–393.",{"doi":3051},"10.15547\u002Ftjs.2017.s.01.065",{"id":26,"text":3053,"url":26,"identifiers":3054},"Sebastian, I. M., Ross, J. W., Beath, C., Mocker, M., Moloney, K. G., & Fonstad, N. O. (2017). How big old companies navigate digital transformation. MIS Quarterly Executive, 16(3), 197–213.",{},{"id":26,"text":3056,"url":26,"identifiers":3057},"Seth, I & Kaplan, J. (2016). Banking on the Cloud. Digital Mckinsey. Retrieved February 1, 2020 from https:\u002F\u002Fwww.mckinsey.com\u002Fbusiness-functions\u002Fmckinsey-digital\u002Four-insights\u002Fbanking-on-the-cloud.",{},{"id":26,"text":3059,"url":26,"identifiers":3060},"Shams, S. M. R., & Solima, L. (2019). Big data management: Implications of dynamic capabilities and data incubator. Management Decision, 57(8), 2113–2123. https:\u002F\u002Fdoi.org\u002F10.1108\u002FMD-07-2018-0846.",{"doi":3061},"10.1108\u002FMD-07-2018-0846",{"id":26,"text":3063,"url":26,"identifiers":3064},"Sharma, H., Bansal, H., & Sharma, A. (2015). Cloud computing on. Retereived April 24, 2020, from http:\u002F\u002Fwww.edureka.co\u002Fblog\u002Fwhat-is-cloud-computing.",{},{"id":26,"text":3066,"url":26,"identifiers":3067},"Sharwood, S. (2018). CBA goes infrastructure-as-code. Private cloud cheaper than public cloud, dual use Azure and AWS for the same workloads. Retrieved February 1, 2020 from https:\u002F\u002Fwww.itnews.com.au\u002Fnews\u002Fcbas-new-private-cloud-nears-completion-moves-to-infrastructure-as-code-511657.",{},{"id":26,"text":3069,"url":26,"identifiers":3070},"Singh, A., & Hess, T. (2017). How chief digital officers promote the digital transformation of their companies. MIS Quarterly Executive, 16(1), 1–17.",{},{"id":26,"text":3072,"url":26,"identifiers":3073},"Sklyar, V., & Kharchenko, V. (2019). Green assurance case: Applications for Internet of Things. In Green IT engineering: Social, business and industrial applications (pp. 351–371). Cham: Springer.",{"doi":3074},"10.1007\u002F978-3-030-00253-4_15",{"id":26,"text":3076,"url":26,"identifiers":3077},"Syam, N., & Sharma, A. (2018). Waiting for a sales renaissance in the fourth industrial revolution: Machine learning and artificial intelligence in sales research and practice. Industrial Marketing Management, 69, 135–146.",{"doi":3078},"10.1016\u002Fj.indmarman.2017.12.019",{"id":26,"text":3080,"url":26,"identifiers":3081},"Teece, D. J., Pisano, G., & Shuen, A. (1997). Dynamic capabilities and strategic management. Strategic Management Journal, 18(7), 509–533.",{"doi":3082},"10.1002\u002F(SICI)1097-0266(199708)18:7\u003C509::AID-SMJ882>3.0.CO;2-Z",{"id":26,"text":3084,"url":26,"identifiers":3085},"Tredinnick, L. (2017). Artificial intelligence and professional roles. Business Information Review, 34(1), 37–41.",{"doi":3086},"10.1177\u002F0266382117692621",{"id":26,"text":3088,"url":26,"identifiers":3089},"Turgeman, L., May, J. H., & Sciulli, R. (2017). Insights from a machine learning model for predicting the hospital Length of Stay (LOS) at the time of admission. Expert Systems with Applications, 78, 376–385.",{"doi":3090},"10.1016\u002Fj.eswa.2017.02.023",{"id":26,"text":3092,"url":26,"identifiers":3093},"Verhoef, P. C., Broekhuizen, T., Bart, Y., Bhattacharya, A., Dong, J. Q., Fabian, N., et al. (2019). Digital transformation: A multidisciplinary reflection and research agenda. Journal of Business Research (in press).",{},{"id":26,"text":3095,"url":26,"identifiers":3096},"Vickery, N. (2016). 5 ways big data is changing the gambling industry. https:\u002F\u002Fdatafloq.com\u002Fread\u002F5-ways-big-data-is-changing-the-gambling-industry\u002F2241. Accessed January 31 2020.",{},{"id":26,"text":3098,"url":26,"identifiers":3099},"Von Leipzig, T., Gamp, M., Manz, D., Schöttle, K., Ohlhausen, P., Oosthuizen, G., et al. (2017). Initialising customer-orientated digital transformation in enterprises. Procedia Manufacturing, 8, 517–524.",{"doi":3100},"10.1016\u002Fj.promfg.2017.02.066",{"id":26,"text":3102,"url":26,"identifiers":3103},"Wamba, S. F., & Akter, S. (2019). Understanding supply chain analytics capabilities and agility for data-rich environments. International Journal of Operations & Production Management, 39(6), 887–912. https:\u002F\u002Fdoi.org\u002F10.1108\u002FIJOPM-01-2019-0025.",{"doi":3104},"10.1108\u002FIJOPM-01-2019-0025",{"id":26,"text":3106,"url":26,"identifiers":3107},"Wamba, S. F., Akter, S., Edwards, A., Chopin, G., & Gnanzou, D. (2015). How ‘big data’ can make big impact: Findings from a systematic review and a longitudinal case study. International Journal of Production Economics, 165, 234–246.",{"doi":3108},"10.1016\u002Fj.ijpe.2014.12.031",{"id":26,"text":3110,"url":26,"identifiers":3111},"Wamba, S. F., & Queiroz, M. M. (2020). Blockchain in the operations and supply chain management: Benefits, challenges and future research opportunities. International Journal of Information Management, 52, 102064.",{"doi":3112},"10.1016\u002Fj.ijinfomgt.2019.102064",{"id":26,"text":3114,"url":26,"identifiers":3115},"Wang, Z., Wang, N., Su, X., & Ge, S. (2020). An empirical study on business analytics affordances enhancing the management of cloud computing data security. International Journal of Information Management, 50, 387–394.",{"doi":3116},"10.1016\u002Fj.ijinfomgt.2019.09.002",{"id":26,"text":3118,"url":26,"identifiers":3119},"Weill, P., & Woerner, S. L. (2018). Is your company ready for a digital future? MIT Sloan Management Review, 59(2), 21–25.",{},{"id":26,"text":3121,"url":26,"identifiers":3122},"Westerman, G., & Bonnet, D. (2015). Revamping your business through digital transformation. MIT Sloan Management Review, 56(3), 10.",{},{"id":26,"text":3124,"url":26,"identifiers":3125},"Westerman, G., Bonnet, D., & Mcafee, A. (2014). The nine elements of digital transformation. MIT Sloan Management Review, 7. https:\u002F\u002Fsloanreview.mit.edu\u002Farticle\u002Fthe-nine-elements-of-digital-transformation\u002F. Accessed 24 Apr 2020.",{},{"id":26,"text":3127,"url":26,"identifiers":3128},"Williamson, O. E. (1979). Transaction-cost economics: The governance of contractual relations. Journal of Law and Economics, 22, 233–261.",{"doi":3129},"10.1086\u002F466942",{"id":26,"text":3131,"url":26,"identifiers":3132},"Williamson, O. E. (1981). The economics of organization: The transaction cost approach. American Journal of Sociology, 87, 548–577.",{"doi":3133},"10.1086\u002F227496",{"id":26,"text":3135,"url":26,"identifiers":3136},"Wixom, B. H., Yen, B., & Relich, M. (2013). Maximizing value from business analytics. MIS Quarterly Executive, 12, 111–123.",{},{"id":26,"text":3138,"url":26,"identifiers":3139},"World Economic Forum. (2016). Digital transformation of industries: Automotive industry. Retrieved February 1, 2020 from https:\u002F\u002Fwww.accenture.com\u002F_acnmedia\u002Faccenture\u002Fconversion-assets\u002Fwef\u002Fpdf\u002Faccenture-automotive-industry.pdf.",{},{"id":26,"text":3141,"url":26,"identifiers":3142},"World Economic Forum. (2017a). Digital transformation initiative: Professional services industry. Retrieved February 11, 2020 from https:\u002F\u002Fwww.accenture.com\u002F_acnmedia\u002Faccenture\u002Fconversion-assets\u002Fwef\u002Fpdf\u002Faccenture-professional-services-industry.pdf.",{},{"id":26,"text":3144,"url":26,"identifiers":3145},"World Economic Forum. (2017b). Digital transformation initiative: Consumer industry. Retrieved February 11, 2020 from https:\u002F\u002Fwww.accenture.com\u002F_acnmedia\u002FAccenture\u002FConversion-Assets\u002FWEF\u002FPDF\u002FAccenture-Consumer-Industries.pdf#zoom=50.",{},{"id":26,"text":3147,"url":26,"identifiers":3148},"World Economic Forum. (2017c). Digital transformation initiative: Media industry. Retrieved February 11, 2020 from https:\u002F\u002Fwww.accenture.com\u002F_acnmedia\u002FAccenture\u002FConversion-Assets\u002FWEF\u002FPDF\u002FAccenture-Media-Industry.pdf#zoom=50.",{},{"id":26,"text":3150,"url":26,"identifiers":3151},"Xia, F., Yang, L. T., Wang, L., & Vine, A. (2012). Internet of Things. International Journal of Communication Systems, 25(9), 1101–1102.",{"doi":3152},"10.1002\u002Fdac.2417",{"id":26,"text":3154,"url":26,"identifiers":3155},"Xia, T., Zhang, W., Chiu, W. S., & Jing, C. (2020). Using cloud computing integrated architecture to improve delivery committed rate in smart manufacturing. Enterprise Information Systems, 1–20 (forthcoming).",{"doi":3156},"10.1080\u002F17517575.2019.1701715",{"id":26,"text":3158,"url":26,"identifiers":3159},"Zheng, Z., Xie, S., Dai, H.-N., & Wang, H. (2016). Blockchain challenges and opportunities: A survey. Work Pap.–2016.",{},{"id":3161,"createTime":3162,"updateTime":3163,"relativeEntities":3164,"slug":3165,"properties":3166,"entityType":776,"verifyStatus":25,"verifyTime":3163,"verifyNote":777,"syncStatus":28,"languages":3177,"translateLanguages":26,"viewCount":36,"primaryUrl":3178,"fullTextUrl":26,"authors":3179,"publicationType":866,"publisherRelationship":3213,"citationCount":149,"citationInfo":3246,"publishDate":3248,"publishYear":2355,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3249,"isForceReanalyzing":1096},"1ba23af3-0b2f-4714-819f-c9345779ee75","2024-04-19T16:10:24.338+00:00","2024-09-15T20:42:32.663+00:00",[],"Genetic-and-hybrid-algorithms-for-graph-coloring",{"mag":3167,"keywords":3169,"openalex":3170,"abstract":3172,"title":3173,"doi":3175},{"VOID":3168},"2055440347",{},{"VOID":3171},"W2055440347",{},{"EN":3174},"Genetic and hybrid algorithms for graph coloring",{"VOID":3176},"10.1007\u002Fbf02125407",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02125407",[3180,3198],{"id":3181,"sortIndex":115,"researcher":26,"roles":3182,"affiliations":3183,"properties":3193},"a809cb6a-0b50-415f-b1ee-c1e0963da3f3",[],[3184],{"id":3185,"sortIndex":36,"affiliation":3186,"properties":26},"ce77650e-27ad-4835-a7d9-d5da3d2cd78d",{"id":3187,"createTime":3188,"updateTime":3188,"relativeEntities":3189,"slug":26,"properties":3190,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"0cf74bc3-e8ac-497a-86ad-54140ce08c22","2023-12-27T12:50:28.045+00:00",[],{"title":3191},{"VI":3192},"Département d'informatique et de recherche opérationnelle, Université de Montréal, Montreal, Canada",{"openalex":3194,"title":3196},{"VOID":3195},"A5071731944",{"EN":3197},"Jacques A. Ferland",{"id":3199,"sortIndex":36,"researcher":26,"roles":3200,"affiliations":3201,"properties":3208},"01db1778-1c3b-486e-8518-50b9050e930a",[],[3202],{"id":3203,"sortIndex":36,"affiliation":3204,"properties":26},"2e47700a-3cec-40ba-b736-e4380d9c9943",{"id":3187,"createTime":3188,"updateTime":3188,"relativeEntities":3205,"slug":26,"properties":3206,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":3207},{"VI":3192},{"openalex":3209,"title":3211},{"VOID":3210},"A5080731117",{"EN":3212},"Charles Fleurent",{"url":26,"publisher":3214,"properties":3241},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3215,"slug":663,"properties":3216,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3219,"manageAffiliations":3220,"indexDatabases":3221,"url":26,"thumbnailPath":26,"statistic":3236,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":3217,"title":3218},{"VOID":666},{"EN":668},[],[],[3222,3229],{"id":729,"indexDatabase":3223,"url":744,"indexYears":26,"academicFieldIds":3228,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":3224,"label":3225,"description":3226,"key":740,"publicationTags":3227,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":3230,"url":722,"indexYears":723,"academicFieldIds":3235,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":3231,"label":3232,"description":3233,"key":719,"publicationTags":3234,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":3237,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":3238,"totalCitation":750,"totalCitationByYear":3239,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":3240,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":3242,"pages":3243,"issue":3245},{"VOID":2348},{"VOID":3244},"437-461",{"VOID":1173},{"total":149,"publishYear":26,"statisticByYear":3247},{"2012":516,"2013":241,"2014":116,"2015":124,"2016":116,"2017":135,"2018":162,"2019":158,"2020":111,"2021":53,"2022":59,"2023":114},"1996-06-01",[3250,3254,3258,3261,3265,3268,3272,3275,3278,3281,3284,3288,3291,3295,3298,3300,3303,3305,3308,3311,3314,3317,3320,3323,3326,3329,3333,3337,3341,3344,3347,3351,3354,3357,3360,3363,3366,3369,3372,3376,3379],{"id":26,"text":3251,"url":26,"identifiers":3252},"R. Battiti and G. Tecchiolli, Parallel biased search for combinatorial optimization: Genetic algorithms and tabu, Microproc. Microsyst. 16(1992)351–367.",{"doi":3253},"10.1016\u002F0141-9331(92)90003-C",{"id":26,"text":3255,"url":26,"identifiers":3256},"R. Battiti and G. Tecchiolli, The reactive tabu search, ORSA J. Comp. 6(1994)126–140.",{"doi":3257},"10.1287\u002Fijoc.6.2.126",{"id":26,"text":3259,"url":26,"identifiers":3260},"T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A comparison of genetic sequencing operators,Proc. 4th Int. Conf. on Genetic Algorithms, ed. R.K. Belew and L.B. Booker (Morgan Kaufmann, San Mateo, CA, 1991) pp. 69–76.",{},{"id":26,"text":3262,"url":26,"identifiers":3263},"D. Brelaz, New methods to color vertices of a graph, Commun. ACM 22(1979)251–256.",{"doi":3264},"10.1145\u002F359094.359101",{"id":26,"text":3266,"url":26,"identifiers":3267},"B. Carter and K. Park, How good are genetic algorithms at finding large cliques: An experimental study, Technical Report BU-CS-93-015, Boston University (1994).",{},{"id":26,"text":3269,"url":26,"identifiers":3270},"M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for coloring graphs, Euro. J. Oper. Res. 32(1987)260–266.",{"doi":3271},"10.1016\u002FS0377-2217(87)80148-0",{"id":26,"text":3273,"url":26,"identifiers":3274},"L. Davis,Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).",{},{"id":26,"text":3276,"url":26,"identifiers":3277},"F. Dammeyer and S. Voss, Dynamic tabu list management using the reverse elimination method, Ann. Oper. Res. 41(1993)31–46.",{"doi":1474},{"id":26,"text":3279,"url":26,"identifiers":3280},"DIMACS, Discrete Mathematics and Theoretical Computer Science anonymous ftp site at dimacs.rutgers.edu.",{},{"id":26,"text":3282,"url":26,"identifiers":3283},"L.J. Eshelman, The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 265–283.",{},{"id":26,"text":3285,"url":26,"identifiers":3286},"C. Fleurent and J.A. Ferland, Genetic hybrids for the quadratic assignment problem, DIMACS Series, Discr. Math. Theor. Comp. Sci. 16(1994)173–187",{"doi":3287},"10.1090\u002Fdimacs\u002F016\u002F08",{"id":26,"text":3289,"url":26,"identifiers":3290},"B.R. Fox and M.B. McMahon, Genetic operators for sequencing problems, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 284–300.",{},{"id":26,"text":3292,"url":26,"identifiers":3293},"C, Friden, A. Hertz and D. de Werra, STABULUS: A technique for finding stable sets in large graphs with tabu search, Computing 42(1989)35–44.",{"doi":3294},"10.1007\u002FBF02243141",{"id":26,"text":3296,"url":26,"identifiers":3297},"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).",{},{"id":26,"text":1495,"url":26,"identifiers":3299},{"doi":1497},{"id":26,"text":3301,"url":26,"identifiers":3302},"F. Glover, Genetic algorithms and scatter search: Unsuspected potentials, Technical Report, University of Colorado at Boulder (1993).",{},{"id":26,"text":1499,"url":26,"identifiers":3304},{"doi":1501},{"id":26,"text":3306,"url":26,"identifiers":3307},"F. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), to appear in Discr. Appl. Math.",{},{"id":26,"text":3309,"url":26,"identifiers":3310},"F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (Blackwell Scientific, Oxford, 1993) pp. 70–141.",{},{"id":26,"text":3312,"url":26,"identifiers":3313},"D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989).",{},{"id":26,"text":3315,"url":26,"identifiers":3316},"J.J. Grefenstette, Incorporating problem specific knowledge into genetic algorithms, in:Genetic Algorithms and Simulated Annealing (Morgan Kaufmann, 1987) pp. 42–60.",{},{"id":26,"text":3318,"url":26,"identifiers":3319},"A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 39(1987)345–351.",{"doi":1532},{"id":26,"text":3321,"url":26,"identifiers":3322},"J.H. Holland,Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).",{},{"id":26,"text":3324,"url":26,"identifiers":3325},"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation, Part II; Graph coloring and number partitioning, Oper. Res. 39(1991)378–406.",{"doi":2420},{"id":26,"text":3327,"url":26,"identifiers":3328},"A. Johri and D.W. Matula, Probabilistic bounds and heuristic algorithms for coloring large random graphs, Technical Report, Southern Methodist University, Dallas, TX (1982).",{},{"id":26,"text":3330,"url":26,"identifiers":3331},"P. L'Écuyer, Efficient and portable combined random number generators, Commun. ACM 31(1988)742–774.",{"doi":3332},"10.1145\u002F62959.62969",{"id":26,"text":3334,"url":26,"identifiers":3335},"F. Leighton, A graph coloring algorithm for large scheduling problems, J. Res. Nat. Bureau of Standards 84(1979)489–505.",{"doi":3336},"10.6028\u002Fjres.084.024",{"id":26,"text":3338,"url":26,"identifiers":3339},"S. Lin, Computer solutions of the traveling salesman problem, Bell. Syst. Tech. J. 44(1965)2245–2269.",{"doi":3340},"10.1002\u002Fj.1538-7305.1965.tb04146.x",{"id":26,"text":3342,"url":26,"identifiers":3343},"S. Lin and B.W. Kernighan, An effective heuristic for the traveling salesman problem, Oper. Res. 21(1973)498–516.",{"doi":1558},{"id":26,"text":3345,"url":26,"identifiers":3346},"C. Morgenstern, Distributed coloration neighborhood search, presented at the15th Int. Symp. on Mathematical Programming, Ann Arbor (1994).",{},{"id":26,"text":3348,"url":26,"identifiers":3349},"H. Muhlenbein, M. Gorges-Schleuter and O. Kramer, Evolution algorithms in combinatorial optimization, Parallel Comp. 7(1988)65–88.",{"doi":3350},"10.1016\u002F0167-8191(88)90098-1",{"id":26,"text":3352,"url":26,"identifiers":3353},"H. Muhlenbein, Evolution in time and space — the parallel genetic algorithm, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 316–335.",{},{"id":26,"text":3355,"url":26,"identifiers":3356},"J.D. Schaffer, L.J. Eshelman and D. Offutt, Spurious correlations and premature convergence in genetic algorithms, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 102–112.",{},{"id":26,"text":3358,"url":26,"identifiers":3359},"G. Syswerda, Uniform crossover in genetic algorithms,Proc. 3rd Int. Conf. on Genetic Algorithms (Morgan Kaufmann, 1989) pp. 2–9.",{},{"id":26,"text":3361,"url":26,"identifiers":3362},"G. Syswerda, A study of reproduction in generational and steady-state genetic algorithms, in:Foundations of Genetic Algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, CA, 1992) pp. 94–101.",{},{"id":26,"text":3364,"url":26,"identifiers":3365},"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp. 17(1991)443–455.",{"doi":1600},{"id":26,"text":3367,"url":26,"identifiers":3368},"E. Taillard, Recherches itératives dirigées parallèles, Ph.D. Thesis, École Polytechnique Fédérale de Lausanne (1993).",{},{"id":26,"text":3370,"url":26,"identifiers":3371},"E. Taillard, Comparison of iteratives searches for the quadratic assignment problem, Technical Report ORWP94\u002F04, DMA, École Polytechnique Fédérale de Lausanne (1994).",{},{"id":26,"text":3373,"url":26,"identifiers":3374},"D.E. Tate and A.E. Smith, A genetic approach to the quadratic assignment problem, Comp. Oper. Res. 22(1995)73–83.",{"doi":3375},"10.1016\u002F0305-0548(93)E0020-T",{"id":26,"text":3377,"url":26,"identifiers":3378},"D. Welsh,Codes and Cryptography (Oxford University Press, New York, 1988).",{},{"id":26,"text":3380,"url":26,"identifiers":3381},"D. Whitley, T. Starkweather and D. Shaner, The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination, in:Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991) pp. 350–372.",{},{"id":3383,"createTime":3384,"updateTime":3384,"relativeEntities":3385,"slug":3386,"properties":3387,"entityType":776,"verifyStatus":25,"verifyTime":3398,"verifyNote":777,"syncStatus":28,"languages":3399,"translateLanguages":26,"viewCount":36,"primaryUrl":3400,"fullTextUrl":26,"authors":3401,"publicationType":866,"publisherRelationship":3488,"citationCount":3522,"citationInfo":3523,"publishDate":3525,"publishYear":3526,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3527,"isForceReanalyzing":1096},"ae055c09-f482-4b91-8bb7-0bbb33b71959","2024-09-05T13:15:50.388+00:00",[],"Big-Data-and-supply-chain-management-a-review-and-bibliometric-analysis",{"mag":3388,"keywords":3390,"openalex":3391,"abstract":3393,"title":3394,"doi":3396},{"VOID":3389},"2416848540",{},{"VOID":3392},"W2416848540",{},{"EN":3395},"Big Data and supply chain management: a review and bibliometric analysis",{"VOID":3397},"10.1007\u002Fs10479-016-2236-y","2024-09-05T13:15:50.387+00:00",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10479-016-2236-y",[3402,3424,3446,3466],{"id":3403,"sortIndex":115,"researcher":26,"roles":3404,"affiliations":3405,"properties":3417},"8d6aac9b-0900-4320-b761-9da5d6067810",[],[3406],{"id":3407,"sortIndex":36,"affiliation":3408,"properties":26},"697cccfb-650b-4f4d-90b0-e70c68d1f63e",{"id":3409,"createTime":3410,"updateTime":3411,"relativeEntities":3412,"slug":3413,"properties":3414,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"00086e7d-65f1-48bb-93b2-9680b3512072","2024-02-12T05:32:11.981+00:00","2025-06-11T13:32:39.400+00:00",[],"Charlton-College-of-Business-University-of-Massachusetts-Dartmouth-North-Dartmouth-MA-02747-2300-USA",{"title":3415},{"VI":3416},"Charlton College of Business, University of Massachusetts Dartmouth, North Dartmouth, MA, 02747-2300, USA",{"openalex":3418,"orcid":3420,"title":3422},{"VOID":3419},"A5046110173",{"VOID":3421},"https:\u002F\u002Forcid.org\u002F0000-0002-6335-1962",{"EN":3423},"Angappa Gunasekaran",{"id":3425,"sortIndex":59,"researcher":26,"roles":3426,"affiliations":3427,"properties":3439},"dc25ec32-16e4-4d57-b775-3ab04a04f1dc",[],[3428],{"id":3429,"sortIndex":36,"affiliation":3430,"properties":26},"e012b459-8eb3-4dca-972f-4b2cffb51c5a",{"id":3431,"createTime":3432,"updateTime":3433,"relativeEntities":3434,"slug":3435,"properties":3436,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"385b4447-53b1-4e6b-8e5b-ff686603ceef","2024-01-18T06:20:26.772+00:00","2024-09-05T13:15:50.787+00:00",[],"Plymouth-Business-School-Plymouth-University-Plymouth-PL4-8AA-UK",{"title":3437},{"VI":3438},"Plymouth Business School, Plymouth University, Plymouth, PL4 8AA, UK",{"openalex":3440,"orcid":3442,"title":3444},{"VOID":3441},"A5052327280",{"VOID":3443},"https:\u002F\u002Forcid.org\u002F0000-0002-9476-4209",{"EN":3445},"Stephen J. Childe",{"id":3447,"sortIndex":36,"researcher":26,"roles":3448,"affiliations":3449,"properties":3461},"36ba8d37-3bac-414b-aa59-14ab0554cac7",[],[3450],{"id":3451,"sortIndex":36,"affiliation":3452,"properties":26},"cb2c0245-c858-479b-b257-04e182510892",{"id":3453,"createTime":3454,"updateTime":3455,"relativeEntities":3456,"slug":3457,"properties":3458,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"8b6d5ae5-c19c-4909-b37e-605bc1298d02","2024-01-09T01:48:33.088+00:00","2024-09-05T13:15:50.413+00:00",[],"Department-of-Industrial-and-Management-Engineering-IIT-Kanpur-Kanpur-208016-India",{"title":3459},{"VI":3460},"Department of Industrial and Management Engineering, IIT Kanpur, Kanpur 208016, India",{"openalex":3462,"title":3464},{"VOID":3463},"A5102505464",{"EN":3465},"Deepa Mishra",{"id":3467,"sortIndex":114,"researcher":26,"roles":3468,"affiliations":3469,"properties":3481},"394bc719-2bf2-4970-b364-852186bc8109",[],[3470],{"id":3471,"sortIndex":36,"affiliation":3472,"properties":26},"0d14ab35-fac6-41c4-be8f-76fb38c7a5b4",{"id":3473,"createTime":3474,"updateTime":3475,"relativeEntities":3476,"slug":3477,"properties":3478,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"a567ffa5-282a-4f90-a681-bf3fc677ab13","2024-01-18T06:20:26.692+00:00","2024-09-05T13:15:50.765+00:00",[],"Kent-Business-School-University-of-Kent-Sail-and-Colour-Loft-The-Historic-Dockyard-Chatham-Kent-ME4-4TE-UK",{"title":3479},{"VI":3480},"Kent Business School, University of Kent, Sail and Colour Loft, The Historic Dockyard, Chatham, Kent ME4 4TE, UK",{"openalex":3482,"orcid":3484,"title":3486},{"VOID":3483},"A5021867135",{"VOID":3485},"https:\u002F\u002Forcid.org\u002F0000-0001-6821-1136",{"EN":3487},"Θάνος Παπαδόπουλος",{"url":26,"publisher":3489,"properties":3516},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3490,"slug":663,"properties":3491,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3494,"manageAffiliations":3495,"indexDatabases":3496,"url":26,"thumbnailPath":26,"statistic":3511,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":3492,"title":3493},{"VOID":666},{"EN":668},[],[],[3497,3504],{"id":729,"indexDatabase":3498,"url":744,"indexYears":26,"academicFieldIds":3503,"indexDatabaseRanking":26},{"id":731,"createTime":732,"updateTime":733,"relativeEntities":3499,"label":3500,"description":3501,"key":740,"publicationTags":3502,"standard":26},[],{"EN":736,"VI":736},{"VI":738,"EN":739},[742,743],[746],{"id":709,"indexDatabase":3505,"url":722,"indexYears":723,"academicFieldIds":3510,"indexDatabaseRanking":727},{"id":711,"createTime":712,"updateTime":713,"relativeEntities":3506,"label":3507,"description":3508,"key":719,"publicationTags":3509,"standard":26},[],{"EN":716,"VI":716},{"EN":716,"VI":718},[721],[725,726],{"impactFactor":36,"impactFactorByYear":3512,"i10Index":116,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":3513,"totalCitation":750,"totalCitationByYear":3514,"totalCitationPerPublication":753,"totalCitationPerPublicationByYear":3515,"hindexLast5Year":116,"hindex":116},{},{"2003":115,"2004":53},{"2003":52,"2004":752},{"2003":52,"2004":755},{"volume":3517,"pages":3519,"issue":3521},{"VOID":3518},"270",{"VOID":3520},"313-336",{"VOID":2646},279,{"total":3522,"publishYear":26,"statisticByYear":3524},{"2016":115,"2017":135,"2018":51,"2019":124,"2020":281,"2021":283,"2022":398,"2023":45,"2024":241},"2018-11-01",2018,[3528,3532,3535,3538,3541,3545,3549,3553,3557,3560,3564,3568,3572,3575,3578,3581,3585,3589,3593,3597,3600,3604,3608,3612,3616,3620,3623,3627,3630,3633,3636,3639,3643,3646,3650,3654,3657,3661,3664,3668,3672,3676,3679,3683,3686,3690,3693,3697,3701,3705,3708,3711,3715,3719,3723,3727,3731,3734,3738,3742,3746,3750,3754,3758,3761,3765,3768,3772,3776,3780,3783,3787,3791,3794,3798,3802,3805,3808,3812,3816,3820,3824,3827,3830,3833,3837,3840,3844,3848,3851,3855,3858,3862,3866,3869,3872,3876,3879,3882,3886,3890,3894,3898,3901,3905,3909,3912,3915,3919,3922,3925,3929,3933,3936,3939,3943,3947,3951,3954,3958,3962,3965,3969,3973,3977,3980,3984,3987,3991,3995,3998,4001,4005,4009,4012,4016,4019,4023,4027,4031,4034,4038,4041,4044,4048,4052,4055,4058,4062,4066],{"id":26,"text":3529,"url":26,"identifiers":3530},"Acker, O., Gröne, F., Blockus, A., & Bange, C. (2011). In-memory analytics–Strategies for real-time CRM. Journal of Database Marketing & Customer Strategy Management, 18(2), 129–136.",{"doi":3531},"10.1057\u002Fdbm.2011.11",{"id":26,"text":3533,"url":26,"identifiers":3534},"Anderson, C. (2008). The end of theory, will the data deluge makes the scientific method obsolete? Edge. http:\u002F\u002Fwww.edge.org\u002F3rd_culture\u002Fanderson08\u002Fanderson08_index.html (25 July 2011).",{},{"id":26,"text":3536,"url":26,"identifiers":3537},"Barton, D., & Court, D. (2012). Making advanced analytics work for you. Harvard Business Review, 90(10), 78–83, 128.",{},{"id":26,"text":3539,"url":26,"identifiers":3540},"Batagelj, V., & Mrvar, A. (2011). Pajek: Program for analysis and visualization of large networks–Reference manual. Slovenia: University of Ljubljana.",{},{"id":26,"text":3542,"url":26,"identifiers":3543},"Bengio, Y. (2009). Learning deep architectures for AI. Foundations and Trends in Machine Learning, 2(1), 1–127.",{"doi":3544},"10.1561\u002F2200000006",{"id":26,"text":3546,"url":26,"identifiers":3547},"Bi, Z., & Cochran, D. (2014). Big Data analytics with applications. Journal of Management Analytics, 1(4), 249–265.",{"doi":3548},"10.1080\u002F23270012.2014.992985",{"id":26,"text":3550,"url":26,"identifiers":3551},"Blondel, V. D., Guillaume, J. L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment. doi: 10.1088\u002F1742-5468\u002F2008\u002F10\u002FP10008 .",{"doi":3552},"10.1088\u002F1742-5468\u002F2008\u002F10\u002FP10008",{"id":26,"text":3554,"url":26,"identifiers":3555},"Bollen, J., Mao, H., & Zeng, X. (2011). Twitter mood predicts the stock market. Journal of Computational Science, 2(1), 1–8.",{"doi":3556},"10.1016\u002Fj.jocs.2010.12.007",{"id":26,"text":3558,"url":26,"identifiers":3559},"Boyd, D. (2010). Social network sites as networked publics: Affordances, dynamics, and implications. In Z. Papacharissi (Ed.), A networked self: Identity, community and culture on social network sites (pp. 39–58). New York: Routledge.",{},{"id":26,"text":3561,"url":26,"identifiers":3562},"Boyd, D., & Crawford, K. (2012). Critical questions for Big Data. Information, Communication and Society, 15(5), 662–679.",{"doi":3563},"10.1080\u002F1369118X.2012.678878",{"id":26,"text":3565,"url":26,"identifiers":3566},"Bozarth, C., Handfield, R., & Das, A. (1998). Stages of global sourcing strategy evolution: an exploratory study. Journal of Operations Management, 16(2–3), 241–255.",{"doi":3567},"10.1016\u002FS0272-6963(97)00040-5",{"id":26,"text":3569,"url":26,"identifiers":3570},"Brin, S., & Page, L. (1998). The anatomy of a large-scale hyper textual web search engine. Computer Networks and ISDN Systems, 30(1–7), 107–117.",{"doi":3571},"10.1016\u002FS0169-7552(98)00110-X",{"id":26,"text":3573,"url":26,"identifiers":3574},"Brown, B., Chul, M., & Manyika, J. (2011). Are you ready for the era of Big Data? McKinsey Quarterly, 4(24–27), 30–35.",{},{"id":26,"text":3576,"url":26,"identifiers":3577},"Casemore, S. (2012). Social media and the coming supply-chain revolution. http:\u002F\u002Fwww3.cfo.com\u002Farticle\u002F2012\u002F2\u002Fsupply-chain_supply-chain-innovation-social-media-casemore-ghg .",{},{"id":26,"text":3579,"url":26,"identifiers":3580},"Cecere, L. (2012). Big Data: Go big or go home? Supply Chain Insights LLC http:\u002F\u002Fsupplychaininsights.com\u002Fwpcontent\u002Fuploads\u002F2012\u002F07\u002FBig_Data_Report_16_JULY_2012.pdf . Accessed 05 Nov 13.",{},{"id":26,"text":3582,"url":26,"identifiers":3583},"Chae, B. K. (2015). Insights from hashtag# supplychain and Twitter Analytics: Considering Twitter and Twitter data for supply chain practice and research. International Journal of Production Economics, 165, 247–259.",{"doi":3584},"10.1016\u002Fj.ijpe.2014.12.037",{"id":26,"text":3586,"url":26,"identifiers":3587},"Chae, B., & Olson, D. (2013). Business analytics for supply chain: A dynamic-capabilities framework. International Journal of Information Technology & Decision Making, 12(9), 9–26.",{"doi":3588},"10.1142\u002FS0219622013500016",{"id":26,"text":3590,"url":26,"identifiers":3591},"Chae, B., Olson, D., & Sheu, C. (2014). The impact of supply chain analytics on operational performance: A resource based view. International Journal of Production Research, 52, 4695–4710.",{"doi":3592},"10.1080\u002F00207543.2013.861616",{"id":26,"text":3594,"url":26,"identifiers":3595},"Chen, C., Ibekwe-SanJuan, F., & Hou, J. (2010). The structure and dynamics of co-citation clusters: A multiple-perspective co-citation analysis. Journal of the American Society for Information Science, 61(7), 1386–1409.",{"doi":3596},"10.1002\u002Fasi.21309",{"id":26,"text":3598,"url":26,"identifiers":3599},"Chen, H., Chiang, R. H. L., & Storey, V. C. (2012). Business intelligence and analytics: From Big Data to big impact. MIS Quarterly, 36(4), 1165–1188.",{"doi":2758},{"id":26,"text":3601,"url":26,"identifiers":3602},"Chen, P., Xie, H., Maslov, S., & Redner, S. (2007). Finding scientific gems with Google’s PageRank algorithm. Journal of Informetrics, 1, 8–15.",{"doi":3603},"10.1016\u002Fj.joi.2006.06.001",{"id":26,"text":3605,"url":26,"identifiers":3606},"Chiu, C. M., Hsu, M. H., & Wang, E. T. G. (2006). Understanding knowledge sharing in virtual communities: An integration of social capital and social cognitive theories. Decision Support Systems, 42(3), 1872–1888.",{"doi":3607},"10.1016\u002Fj.dss.2006.04.001",{"id":26,"text":3609,"url":26,"identifiers":3610},"Clauset, A., Newman, M. E. J., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70(6), 1–6.",{"doi":3611},"10.1103\u002FPhysRevE.70.066111",{"id":26,"text":3613,"url":26,"identifiers":3614},"Cohen, J., Dolan, B., Dunlap, M., Hellerstein, J. M., & Welton, C. (2009). MAD skills: New analysis practices for Big Data. Proceedings of the VLDB Endowment, 2(2), 1481–1492.",{"doi":3615},"10.14778\u002F1687553.1687576",{"id":26,"text":3617,"url":26,"identifiers":3618},"Craighead, C. W., Hult, G. T. M., & Ketchen, D. J, Jr. (2009). The effects of innovation-cost strategy, knowledge, and action in the supply chain on firm performance. Journal of Operations Management, 27(5), 405–421.",{"doi":3619},"10.1016\u002Fj.jom.2009.01.002",{"id":26,"text":3621,"url":26,"identifiers":3622},"Cukier, K. (2010). The economist, data, data everywhere: A special report on managing information. Retrieved from http:\u002F\u002Fwww.economist.com\u002Fnode\u002F15557443 , February 25.",{},{"id":26,"text":3624,"url":26,"identifiers":3625},"Culnan, M. (1986). The intellectual development of management information systems. Management Science, 32(2), 156–172.",{"doi":3626},"10.1287\u002Fmnsc.32.2.156",{"id":26,"text":3628,"url":26,"identifiers":3629},"Davenport, T. H. (2006). Competing on analytics. Harvard Business Review, 84(1), 84–93.",{},{"id":26,"text":3631,"url":26,"identifiers":3632},"Davenport, T. H., & Harris, J. G. (2007). Competing on analytics: The new science of winning. Cambridge: Harvard Business School Press.",{},{"id":26,"text":3634,"url":26,"identifiers":3635},"Davenport, T. H., & Patil, D. J. (2012). Data scientist: The sexiest job of the 21st century. Harvard Business Review, 90(10), 70–76.",{},{"id":26,"text":3637,"url":26,"identifiers":3638},"Dean, J., & Ghemawat, S. (2004). MapReduce: Simplified data processing on large clusters, in: Proc. 6th USENIX symposium on operating systems design and implementation, OSDI 2004, San Francisco, USA, December.",{},{"id":26,"text":3640,"url":26,"identifiers":3641},"Demirkan, H., & Delen, D. (2013). Leveraging the capabilities of service-oriented decision support systems: Putting analytics and big data in cloud. Decision Support Systems, 55(1), 412–421.",{"doi":3642},"10.1016\u002Fj.dss.2012.05.048",{"id":26,"text":3644,"url":26,"identifiers":3645},"Diebold, F. X. (2012). A personal perspective on the origin(s) and development of “Big Data”: The phenomenon, the term, and the discipline. Scholarly Paper No. ID 2202843, Social Science Research Network. Retrieved from http:\u002F\u002Fpapers.ssrn.com\u002Fsol3\u002Fpapers.cfm?abstractid=2202843 .",{},{"id":26,"text":3647,"url":26,"identifiers":3648},"Ding, Y., & Cronin, B. (2011). Popular and\u002For prestigious? Measures of scholarly esteem. Information Processing Management, 47(1), 80–96.",{"doi":3649},"10.1016\u002Fj.ipm.2010.01.002",{"id":26,"text":3651,"url":26,"identifiers":3652},"Ding, Y., Yan, E., Frazho, A., & Caverlee, J. (2009). PageRank for ranking authors in co-citation networks. Journal of the American Society for Information Science and Technology, 60(11), 2229–2243.",{"doi":3653},"10.1002\u002Fasi.21171",{"id":26,"text":3655,"url":26,"identifiers":3656},"Domingos, P., & Richardson, M. (2001). Mining the network value of customers. Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (pp. 57–66). New York: ACM.",{},{"id":26,"text":3658,"url":26,"identifiers":3659},"Dubey, R., Gunasekaran, A., Childe, S. J., Wamba, S. F., & Papadopoulos, T. (2016). The impact of Big Data on world-class sustainable manufacturing. The International Journal of Advanced Manufacturing Technology, 84(1), 631–645.",{"doi":3660},"10.1007\u002Fs00170-015-7674-1",{"id":26,"text":3662,"url":26,"identifiers":3663},"Elberse, A. (2008). Should you invest in the long tail? HBS Centennial Issue Harvard Business Review, 86(7–8), 88–96. (HBS Centennial Issue).",{},{"id":26,"text":3665,"url":26,"identifiers":3666},"Erikson, R. S., & Wlezien, C. (2012). Markets vs. polls as election predictors: An historical assessment. Electoral Studies, 31, 532–539.",{"doi":3667},"10.1016\u002Fj.electstud.2012.04.008",{"id":26,"text":3669,"url":26,"identifiers":3670},"Fahimnia, B., Sarkis, J., & Davarzani, H. (2015). Green supply chain management: A review and bibliometric analysis. International Journal of Production Economics, 162, 101–114.",{"doi":3671},"10.1016\u002Fj.ijpe.2015.01.003",{"id":26,"text":3673,"url":26,"identifiers":3674},"Fare, R., Grosskopf, S., Lindgren, B., & Roos, P. (1994a). Productivity developments in Swedish hospitals: A Malmquist output index approach. In A. Charnes, W. W. Cooper, A. Y. Lewin, & L. M. Seiford (Eds.), Data envelopment analysis: Theory, methodology and applications (pp. 253–272). Boston: Kluwer Academic Publishers.",{"doi":3675},"10.1007\u002F978-94-011-0637-5_13",{"id":26,"text":3677,"url":26,"identifiers":3678},"Feng, Z. Y., Guo, X. H., & Zeng, D. J. (2013). On the research frontiers of business management in the context of Big Data. Journal of Management Sciences in China, 16(1), 1–9.",{},{"id":26,"text":3680,"url":26,"identifiers":3681},"Fildes, R., & Petropoulos, F. (2015). Simple versus complex selection rules for forecasting many time series. Journal of Business Research, 68(8), 1692–1701.",{"doi":3682},"10.1016\u002Fj.jbusres.2015.03.028",{"id":26,"text":3684,"url":26,"identifiers":3685},"Flory, M. M. (2012). The big kahuna. Marketing Research, 24(2), 3.",{},{"id":26,"text":3687,"url":26,"identifiers":3688},"Flyvbjerg, B. (2014). What you should know about megaprojects and why: An overview. Project Management Journal, 45(2), 6–19.",{"doi":3689},"10.1002\u002Fpmj.21409",{"id":26,"text":3691,"url":26,"identifiers":3692},"Forrester. (2012). The Big Deal about Big Data for customer engagement business: Leaders must lead big data initiatives to derive value. http:\u002F\u002Fwww.forrester.com\u002FThe+Big+Deal+About+Big+Data+For+Customer+Engagement\u002Ffulltext\u002F-\u002FE-RES72241 .",{},{"id":26,"text":3694,"url":26,"identifiers":3695},"Gandomi, A., & Haider, M. (2015). Beyond the hype: Big Data concepts, methods, and analytics. International Journal of Information Management, 35(2), 137–144.",{"doi":3696},"10.1016\u002Fj.ijinfomgt.2014.10.007",{"id":26,"text":3698,"url":26,"identifiers":3699},"Gardner, E. S, Jr. (2006). Exponential smoothing: The state of the art-Part II. International Journal of Forecasting, 22, 637–666.",{"doi":3700},"10.1016\u002Fj.ijforecast.2006.03.005",{"id":26,"text":3702,"url":26,"identifiers":3703},"Garfield, E. (1972). Citation analysis as a tool in journal evaluation. Science, 178, 471–479.",{"doi":3704},"10.1126\u002Fscience.178.4060.471",{"id":26,"text":3706,"url":26,"identifiers":3707},"Gephi. (2013). Gephi—Makes graphs handy. https:\u002F\u002Fgephi.org .",{},{"id":26,"text":3709,"url":26,"identifiers":3710},"Gobble, M. M. (2013). Big Data: The next big thing in innovation. Research Technology Management, 56(1), 64–66.",{"doi":2845},{"id":26,"text":3712,"url":26,"identifiers":3713},"Goodwin, P. (2015). When simple alternatives to Bayes formula work well: Reducing the cognitive load when updating probability forecasts. Journal of Business Research, 68(8), 1686–1691.",{"doi":3714},"10.1016\u002Fj.jbusres.2015.03.027",{"id":26,"text":3716,"url":26,"identifiers":3717},"Graefe, A. (2015). Improving forecasts using equally weighted predictors. Journal of Business Research, 68(8), 1792–1799.",{"doi":3718},"10.1016\u002Fj.jbusres.2015.03.038",{"id":26,"text":3720,"url":26,"identifiers":3721},"Graefe, A., Küchenhoff, H., Stierle, V., & Riedl, B. (2015). Limitations of ensemble Bayesian model averaging for forecasting social science problems. International Journal of Forecasting, 31(3), 943–951.",{"doi":3722},"10.1016\u002Fj.ijforecast.2014.12.001",{"id":26,"text":3724,"url":26,"identifiers":3725},"Hazen, B. T., Boone, C. A., Ezell, J. D., & Jones-Farmer, L. A. (2014). Data quality for data science, predictive analytics, and Big Data in supply chain management: An introduction to the problem and suggestions for research and applications. International Journal of Production Economics, 154, 72–80.",{"doi":3726},"10.1016\u002Fj.ijpe.2014.04.018",{"id":26,"text":3728,"url":26,"identifiers":3729},"Hjørland, B. (2013). Citation analysis: A social and dynamic approach to knowledge organization. Information Processing Management, 49(6), 1313–1325.",{"doi":3730},"10.1016\u002Fj.ipm.2013.07.001",{"id":26,"text":3732,"url":26,"identifiers":3733},"Hopkins, M. S., Lavalle, S., & Balboni, F. (2010). The new intelligent enterprise: 10 insights: A first look at the new intelligent enterprise survey. MIT Sloan Management Review, 52(1), 22.",{},{"id":26,"text":3735,"url":26,"identifiers":3736},"Huang, M-Ch., Yen, G.-F., & Liu, T-Ch. (2014). Re-examining supply chain integration and the supplier’s performance relationships under uncertainty. Supply Chain Management: An International Journal, 19(1), 64–78.",{"doi":3737},"10.1108\u002FSCM-04-2013-0114",{"id":26,"text":3739,"url":26,"identifiers":3740},"Hughes, A. L., & Palen, L. (2009). Twitter adoption and use in mass convergence and emergency events. International Journal of Emergency Management, 6, 248–260.",{"doi":3741},"10.1504\u002FIJEM.2009.031564",{"id":26,"text":3743,"url":26,"identifiers":3744},"Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007). Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys’07 Proceedings of the 2nd ACM SIGOPS\u002FEuroSys European conference on computer systems (Vol. 41(3), pp. 59–72).",{"doi":3745},"10.1145\u002F1272996.1273005",{"id":26,"text":3747,"url":26,"identifiers":3748},"Ishii, R. P., & de Mello, R. F. (2012). An online data access prediction and optimization approach for distributed systems. IEEE Transactions on Parallel and Distributed System, 23(6), 1017–1029.",{"doi":3749},"10.1109\u002FTPDS.2011.256",{"id":26,"text":3751,"url":26,"identifiers":3752},"Jacobs, A. (2009). The pathologies of Big Data. Magazine Queue-Data, 7(6), 10.",{"doi":3753},"10.1145\u002F1563821.1563874",{"id":26,"text":3755,"url":26,"identifiers":3756},"Jha, A. K., DesRoches, C. M., Kralovec, P. D., & Joshi, M. S. (2010). A progress report on electronic health records in US hospitals. Health Affairs, 29(10), 1951–1957.",{"doi":3757},"10.1377\u002Fhlthaff.2010.0502",{"id":26,"text":3759,"url":26,"identifiers":3760},"Kahneman, D., Lovallo, D., & Olivier, O. (2011). Before you make that big decision. Harvard Business Review, 89(6), 50–60.",{},{"id":26,"text":3762,"url":26,"identifiers":3763},"Kempe, D., Kleinberg, J., & Tardos, E. (2003). Maximizing the spread of influence through a social network. KDD ‘03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 137–146). New York, NY: ACM.",{"doi":3764},"10.1145\u002F956750.956769",{"id":26,"text":3766,"url":26,"identifiers":3767},"Kempe, D., Kleinberg, J., & Tardos, E. (2005). Influential nodes in a diffusion model for social networks. In ICALP 2005:Proceedings of the 32nd international colloquium on automata, languages and programming (pp. 1127–1138).",{},{"id":26,"text":3769,"url":26,"identifiers":3770},"KetchenJr, D. J., & Hult, G. T. M. (2007). Bridging organization theory and supply chain management: The case of best value supply chains. Journal of Operations Management, 25(2), 573–580.",{"doi":3771},"10.1016\u002Fj.jom.2006.05.010",{"id":26,"text":3773,"url":26,"identifiers":3774},"Khorheh, M. A., Moisiadis, F., & Davarzani, H. (2015). Socio-environmental performance of transportation systems. Management of Environmental Quality: An International Journal, 26(6), 826–851.",{"doi":3775},"10.1108\u002FMEQ-09-2014-0140",{"id":26,"text":3777,"url":26,"identifiers":3778},"Kleinberg, J. (2007). Cascading behavior in networks: Algorithmic and economic issues. In N. Nisan, T. Roughgarden, É. Tardos, & V. V. Vazirani (Eds.), Algorithmic Game Theory (pp. 613–632). Cambridge University Press.",{"doi":3779},"10.1017\u002FCBO9780511800481.026",{"id":26,"text":3781,"url":26,"identifiers":3782},"Laney, D. (2001). 3d Data management: Controlling data volume, velocity and variety. Technical report Application Delivery Strategies Meta Group.",{},{"id":26,"text":3784,"url":26,"identifiers":3785},"Larrick, R. P., & Soll, J. B. (2006). Intuitions about combining opinions: Misappreciation of the averaging principle. Management Science, 52, 111–127.",{"doi":3786},"10.1287\u002Fmnsc.1050.0459",{"id":26,"text":3788,"url":26,"identifiers":3789},"Larsen, P. O., & von Ins, M. (2010). The rate of growth in scientific publication and the decline in coverage provided by science citation index. Scientometrics, 84(3), 575–603.",{"doi":3790},"10.1007\u002Fs11192-010-0202-z",{"id":26,"text":3792,"url":26,"identifiers":3793},"LaValle, S., Lesser, E., Shockley, R., Hopkins, M. S., & Kruschwitz, N. (2011). Big Data: Analytics and the path from insights to value. MIT Sloan Management Review, 52(2), 21–32.",{},{"id":26,"text":3795,"url":26,"identifiers":3796},"Leong, D. (2009). A new revolution in enterprise storage architecture. IEEE Potentials, 28(6), 32–33.",{"doi":3797},"10.1109\u002FMPOT.2009.934894",{"id":26,"text":3799,"url":26,"identifiers":3800},"Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007). Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data, 1(1), 1–41.",{"doi":3801},"10.1145\u002F1217299.1217301",{"id":26,"text":3803,"url":26,"identifiers":3804},"Leydesdorff, L. (2011). Bibliometrics\u002Fcitation networks. In G. A. Barnett (Ed.), Encyclopedia of social networks. Thousand Oaks, CA: SAGE Publications Inc.",{},{"id":26,"text":3806,"url":26,"identifiers":3807},"Lovis, C., Spahni, S., Cassoni-Schoellhammer, N., & Geissbuhler, A. (2006). Comprehensive management of the access to a component-based healthcare information system. Studies in Health Technology and Informatics, 124, 251–256.",{},{"id":26,"text":3809,"url":26,"identifiers":3810},"Lynch, C. (2008). Big Data: How do your data grow? Nature, 455(7209), 28–29.",{"doi":3811},"10.1038\u002F455028a",{"id":26,"text":3813,"url":26,"identifiers":3814},"MacRoberts, M. H., & MacRoberts, B. R. (1989). Problems of citation analysis: A critical review. Journal of the American Society for Information Science, 40(5), 342–349.",{"doi":3815},"10.1002\u002F(SICI)1097-4571(198909)40:5\u003C342::AID-ASI7>3.0.CO;2-U",{"id":26,"text":3817,"url":26,"identifiers":3818},"MacRoberts, M. H., & MacRoberts, B. R. (2010). Problems of citation analysis: A study of uncited and seldom-sited influences. Journal of the American Society for Information Science and Technology, 61(1), 1–12.",{"doi":3819},"10.1002\u002Fasi.21228",{"id":26,"text":3821,"url":26,"identifiers":3822},"Makridakis, S., & Hibon, M. (2000). The M-3 competition: Results, conclusions and implications. International Journal of Forecasting, 16, 451–476.",{"doi":3823},"10.1016\u002FS0169-2070(00)00057-1",{"id":26,"text":3825,"url":26,"identifiers":3826},"Manyika, J., Chui, M., Brown, B., Bughin, J., Dobbs, R., Roxburgh, C., et al. (2011). Big Data: The Next Frontier for Innovation. McKinsey Global Institute: Competition and Productivity.",{},{"id":26,"text":3828,"url":26,"identifiers":3829},"Mayer-Schönberger, V., & Cukier, K. (2013). Big Data: A revolution that will transform how we live, work, and think. New York: Houghton Mifflin Harcourt.",{},{"id":26,"text":3831,"url":26,"identifiers":3832},"McAfee A., & Brynjolfsson E. (2012). Big Data: The management revolution. Harvard Business Review, 90 (10), 60–66, 68, 128.",{},{"id":26,"text":3834,"url":26,"identifiers":3835},"McGlynn, E. (2008). The case for keeping quality on the health reform agenda (p. 3). Technical report, June: Testimony before the U.S. Senate Committee on Finance.",{"doi":3836},"10.7249\u002FCT306",{"id":26,"text":3838,"url":26,"identifiers":3839},"Mekhjian, H., Saltz, J., Rogers, P., & Kamal, J. (2003). Impact of CPOE order sets on lab orders. In: AMIA Annual Symposium Proceedings, p. 931.",{},{"id":26,"text":3841,"url":26,"identifiers":3842},"Mervis, J. (2012). Agencies rally to tackle Big Data. Science, 336(6077), 22.",{"doi":3843},"10.1126\u002Fscience.336.6077.22",{"id":26,"text":3845,"url":26,"identifiers":3846},"Mishra, D., Gunasekaran, A., Childe, S., Papadopoulos, T., & Dubey, R. (2016a). Vision, applications and future challenges of Internet of Things: A bibliometric study of the recent literature. Industrial Management and Data Systems (Accepted Paper).",{"doi":3847},"10.1108\u002FIMDS-11-2015-0478",{"id":26,"text":3849,"url":26,"identifiers":3850},"Mishra, D., Luo, Z., Jiang, S., Papadopoulos, T., & Dubey, R. (2016b). A bibliographic study on Big Data: Concepts. Trends and Challenges (Accepted Paper): Business Process Management Journal.",{},{"id":26,"text":3852,"url":26,"identifiers":3853},"Narayanam, R., & Narahari, Y. (2011). A shapley value based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering, 8(1), 130–147.",{"doi":3854},"10.1109\u002FTASE.2010.2052042",{"id":26,"text":3856,"url":26,"identifiers":3857},"Neumeyer, L., Robbins, B., Nair, A., & Kesari, A. (2010). S4: Distributed stream computing platform. IEEE Data Mining Workshops (ICDMW) (pp. 170–177). Sydney: Australia.",{},{"id":26,"text":3859,"url":26,"identifiers":3860},"Oh, L., Teo, H., & Sambamurthy, V. (2012). The effects of retail channel integration through the use of information technologies on firm performance. Journal of Operations Management, 30(1), 368–381.",{"doi":3861},"10.1016\u002Fj.jom.2012.03.001",{"id":26,"text":3863,"url":26,"identifiers":3864},"O’Leary, D. E. (2011). Blog Mining-Review and extensions: From each according to his opinion. Decision Support Systems, 51(4), 821–830.",{"doi":3865},"10.1016\u002Fj.dss.2011.01.016",{"id":26,"text":3867,"url":26,"identifiers":3868},"Oracle. (2012). Big Data for the enterprise. Redwood Shores, CA: Oracle.",{},{"id":26,"text":3870,"url":26,"identifiers":3871},"Oxford Economics. (2011). The new digital economy: How it will transform business. http:\u002F\u002Fwww.google.co.in\u002Furl?sa=t&rct=j&q=&esrc=s&source=web&cd=3&ved=0CD0QFjAC&url=http%3A%2F%2Fwww.businessandleadership.com%2Fdownload%2Ffs%2Fdoc%2Freports%2Fthe-new-digital-economy-1.pdf&ei=DeHUUpuWM66QiQfjs4HIBA&usg=AFQjCNGQKXaQccqoEy8Na0ctStXgaJPH1Q&bvm=bv.59378465,d.aGc . Accessed 10 January 14.",{},{"id":26,"text":3873,"url":26,"identifiers":3874},"Paloviita, A. (2009). Stakeholder perceptions of alternative food entrepreneurs. Management and Sustainable Development, World Review of Entrepreneurship, 5(4), 395–406.",{"doi":3875},"10.1504\u002FWREMSD.2009.031627",{"id":26,"text":3877,"url":26,"identifiers":3878},"Patil, R. (2014). Supermarket Tesco pioneers big data. http:\u002F\u002Fdataconomy.com\u002Ftesco-pioneers-big-data\u002F . Accessed 30 April 2016.",{},{"id":26,"text":3880,"url":26,"identifiers":3881},"Persson, O., Danell, R., & Schneider, J. W. (2009). How to use bibexcel for various types of bibliometric analysis. In: In F. Åström, R. Danell, B. Larsen, & J. W. Schneider (Eds.), Celebrating scholarly communication studies: A Festschrift for Olle Persson at his 60th Birthday. 05-S, International Society for Scientometrics and Informetrics, 9–24.",{},{"id":26,"text":3883,"url":26,"identifiers":3884},"Pilkington, A., & Liston-Heyes, C. (1999). Is production and operations management a discipline? A citation\u002Fco-citation study. International Journal of Operations and Production Management, 19(1), 7–20.",{"doi":3885},"10.1108\u002F01443579910244188",{"id":26,"text":3887,"url":26,"identifiers":3888},"Pilkington, A., & Meredith, J. (2009). The evolution of the intellectual structure of operations management-1980-2006: A citation\u002Fco-citation analysis. Journal of Operations Management, 27(3), 185–202.",{"doi":3889},"10.1016\u002Fj.jom.2008.08.001",{"id":26,"text":3891,"url":26,"identifiers":3892},"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004). Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America, 101(9), 2658–2663.",{"doi":3893},"10.1073\u002Fpnas.0400054101",{"id":26,"text":3895,"url":26,"identifiers":3896},"Ramos-Rodriguez, A. R., & Ruiz-Navarro, J. (2004). Changes in the intellectual structure of strategic management research: A bibliometric study of the Strategic Management Journal, 1980–2000. Strategic Management Journal, 25(10), 981–1004.",{"doi":3897},"10.1002\u002Fsmj.397",{"id":26,"text":3899,"url":26,"identifiers":3900},"Records, R. L., & Fisher, Q. K. (2014). Manufacturers connect the dots with Big Data and analytics. Computer Science Corporation (pp. 1–6). Accessed 31 May 2014.",{},{"id":26,"text":3902,"url":26,"identifiers":3903},"Reinsdorf, M. B., Diewert, W. E., & Ehemann, C. (2002). Additive decompositions for Fisher, Törnqvist and geometric mean indexes. Journal of Economic and Social Measurement, 28, 51–61.",{"doi":3904},"10.3233\u002FJEM-2003-0194",{"id":26,"text":3906,"url":26,"identifiers":3907},"Richardson, M., & Domingos, P. (2002). Mining knowledge-sharing sites for viral marketing. Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, Edmonton (pp. 61–70). Canada: ACM Press.",{"doi":3908},"10.1145\u002F775047.775057",{"id":26,"text":3910,"url":26,"identifiers":3911},"Roberts, S. (2004). Self-experimentation as a source of new ideas: Sleep, mood, health and weight. Behavioral and Brain Sciences, 27, 227–262.",{},{"id":26,"text":3913,"url":26,"identifiers":3914},"Rogers, E. M. (2003). Diffusion of innovations (5th ed.). New York: Free Press.",{},{"id":26,"text":3916,"url":26,"identifiers":3917},"Rowley, J., & Slack, F. (2004). Conducting a literature review. Management Research News, 27, 31–39.",{"doi":3918},"10.1108\u002F01409170410784185",{"id":26,"text":3920,"url":26,"identifiers":3921},"Russom, P. (2011a). The Three Vs of Big Data Analytics, TDWI. http:\u002F\u002Ftdwi.org\u002Fblogs\u002Fphiliprussom\u002F2011\u002F06\u002Fthree-vs-of-big-data-analytics-3-data-velocity.aspx .",{},{"id":26,"text":3923,"url":26,"identifiers":3924},"Russom, P. (2011b). Big Data analytics. Best Practices Report, Fourth Quarter, The Data Warehouse Institute, Renton, WA. September 18 2011. http:\u002F\u002Ftdwi.org .",{},{"id":26,"text":3926,"url":26,"identifiers":3927},"Sagiroglu, S., & Sinanc, D. (2013). Big Data: A review.In International conference on collaboration technologies and systems (CTS) (pp. 42–47).",{"doi":3928},"10.1109\u002FCTS.2013.6567202",{"id":26,"text":3930,"url":26,"identifiers":3931},"Sakr, S., Liu, A., Batista, D. M., & Alomari, M. (2011). A survey of large scale data management approaches in cloud environments. IEEE Communications Surveys & Tutorials, 13(3), 311–336.",{"doi":3932},"10.1109\u002FSURV.2011.032211.00087",{"id":26,"text":3934,"url":26,"identifiers":3935},"Sanders, N. R., & Ganeshan, R. (2015). Production and operations management. Special issue of production and operations management on “Big Data in Supply Chain Management”, 24(5), 852–853.",{},{"id":26,"text":3937,"url":26,"identifiers":3938},"SC Digital. (2014). Impact of Big Data and analytics in supply chain execution. http:\u002F\u002Fwww.supplychaindigital.com\u002Flogistics\u002F3382\u002FImpact-of-Big-Data-and-Analytics-in-supply-chain-execution . Accessed 30 April 2016",{},{"id":26,"text":3940,"url":26,"identifiers":3941},"Schadt, E. E., Linderman, M. D., Sorenson, J., Lee, L., & Nolan, G. P. (2010). Computational solutions to large-scale data management and analysis. Nature Reviews Genetics, 11(9), 647–657.",{"doi":3942},"10.1038\u002Fnrg2857",{"id":26,"text":3944,"url":26,"identifiers":3945},"Schoenherr, T., & Speier-Pero, C. (2015). Data science, predictive analytics, and Big Data in supply chain management: Current state and future potential. Journal of Business Logistics, 36(1), 120–132.",{"doi":3946},"10.1111\u002Fjbl.12082",{"id":26,"text":3948,"url":26,"identifiers":3949},"Scott, S. G., & Lane, V. R. (2000). A stakeholder approach to organizational identity. Academy of Management Review, 25(1), 43–62.",{"doi":3950},"10.5465\u002Famr.2000.2791602",{"id":26,"text":3952,"url":26,"identifiers":3953},"Segel, E., & Heer, J. (2010). Narrative visualization: Telling stories with data. TVCG: Transactions on Visualization and Computer Graphics, 16(6), 1139–1148.",{},{"id":26,"text":3955,"url":26,"identifiers":3956},"Sharplin, A., & Mabry, R. (1985). The relative importance of journals used in management research: An alternative ranking. Human Relations, 38(2), 139–149.",{"doi":3957},"10.1177\u002F001872678503800204",{"id":26,"text":3959,"url":26,"identifiers":3960},"Sidorova, A., Evangelopoulos, N., Valacich, J. S., & Ramakrishnan, T. (2008). Uncovering the intellectual core of the information systems discipline. MIS Quarterly, 32(3), 467–482.",{"doi":3961},"10.2307\u002F25148852",{"id":26,"text":3963,"url":26,"identifiers":3964},"Slone, R. E. (2004). Leading a supply chain turn around. Harvard Business Review, 82(10), 114–121.",{},{"id":26,"text":3966,"url":26,"identifiers":3967},"Small, H. (1973). Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the American Society for Information Science, 24(4), 265–269.",{"doi":3968},"10.1002\u002Fasi.4630240406",{"id":26,"text":3970,"url":26,"identifiers":3971},"Song, M., Fisher, R., Wang, J.-L., & Cui, L.-B. (2016). Environmental performance evaluation with Big Data: Theories and methods. Annals of Operations Research,. doi: 10.1007\u002Fs10479-016-2158-8 .",{"doi":3972},"10.1007\u002Fs10479-016-2158-8",{"id":26,"text":3974,"url":26,"identifiers":3975},"Stieglitz, S., & Dang-Xuan, L. (2013). Emotions and information diffusion in social media–Sentiment of microblogs and sharing behavior. Journal of Management Information Systems, 29, 217–248.",{"doi":3976},"10.2753\u002FMIS0742-1222290408",{"id":26,"text":3978,"url":26,"identifiers":3979},"Strawn, G. O. (2012). Scientific research: How many paradigms? Educause Review, 47(3), 26–34.",{},{"id":26,"text":3981,"url":26,"identifiers":3982},"Tan, K. H., Zhan, Y., Ji, G., Ye, F., & Chang, C. (2015). Harvesting big data to enhance supply chain innovation capabilities: An analytic infrastructure based on deduction graph. International Journal of Production Economics, 165, 223–233.",{"doi":3983},"10.1016\u002Fj.ijpe.2014.12.034",{"id":26,"text":3985,"url":26,"identifiers":3986},"Terziovski, M. (2010). Innovation practice and its performance implications in small and medium enterprises (SMEs) in the manufacturing sector: A resource-based view. Strategic Management Journal, 31(8), 892–902.",{},{"id":26,"text":3988,"url":26,"identifiers":3989},"Tessier, T. H., & Armstrong, J. S. (2015). Decomposition of time-series by level and change. Journal of Business Research, 68(8), 1755–1758.",{"doi":3990},"10.1016\u002Fj.jbusres.2015.03.035",{"id":26,"text":3992,"url":26,"identifiers":3993},"Thelwall, M., Buckley, K., & Paltoglou, G. (2011). Sentiment in Twitter events. Journal of the American Society for Information Science and Technology, 62, 406–418.",{"doi":3994},"10.1002\u002Fasi.21462",{"id":26,"text":3996,"url":26,"identifiers":3997},"Thibeault, J., & Wadsworth, K. (2014). Delivering digital experiences that people want to share. Hoboken: Wiley.",{},{"id":26,"text":3999,"url":26,"identifiers":4000},"Tieman, J. (2003). Experimenting with quality. CMS-premier initiative to reward best, punish worst. Modern Healthcare, 33(28), 6.",{},{"id":26,"text":4002,"url":26,"identifiers":4003},"Trkman, P., McCormack, K., Oliveira, M., & Ladeira, M. (2010). The impact of business analytics on supply chain performance. Decision Support Systems, 49(3), 318–327.",{"doi":4004},"10.1016\u002Fj.dss.2010.03.007",{"id":26,"text":4006,"url":26,"identifiers":4007},"Tsai, J., Raghu, T. S., & Shao, B. B. M. (2013). Information systems and technology sourcing strategies of e-retailers for value chain enablement. Journal of Operations Management, 31(6), 345–362.",{"doi":4008},"10.1016\u002Fj.jom.2013.07.009",{"id":26,"text":4010,"url":26,"identifiers":4011},"van Eck, N.J., & Waltman, L. (2013). Manual for VOSviewer Version 1.5.4, Universiteit Leiden and Erasmus Universiteit Rotterdam.",{},{"id":26,"text":4013,"url":26,"identifiers":4014},"Vokurka, R. J. (1996). The relative importance of journals used in operations management research: A citation analysis. Journal of Operations Management, 14(4), 345–355.",{"doi":4015},"10.1016\u002FS0272-6963(96)00092-7",{"id":26,"text":4017,"url":26,"identifiers":4018},"Wagner, A., Anicic, D., Stühmer, R., Stojanovic, N., Harth, A., & Studer, R. (2010). Linked data and complex event processing for the smart energy grid. In Proceedings 2010 of CEUR Workshop.",{},{"id":26,"text":4020,"url":26,"identifiers":4021},"Waller, M. A., & Fawcett, S. E. (2013a). Click here for a data scientist: Big data, predictive analytics, and theory development in the era of a maker movement supply chain. Journal of Business Logistics, 34(4), 249–252.",{"doi":4022},"10.1111\u002Fjbl.12024",{"id":26,"text":4024,"url":26,"identifiers":4025},"Waller, M. A., & Fawcett, S. E. (2013b). Data science, predictive analytics, and Big Data: A revolution that will transform supply chain design and management. Journal of Business Logistics, 34(2), 77–84.",{"doi":4026},"10.1111\u002Fjbl.12010",{"id":26,"text":4028,"url":26,"identifiers":4029},"Wamba, S. F., & Akter, S. (2015). Big data analytics for supply chain management: A literature review and research agenda. In J. Barjis, R. Pergl, & E. Babkin (Eds.), Enterprise and Organizational Modeling and Simulation (Vol. 231, pp. 61–72). Springer International Publishing.",{"doi":4030},"10.1007\u002F978-3-319-24626-0_5",{"id":26,"text":4032,"url":26,"identifiers":4033},"Wamba, S. F., Akter, S., Edwards, A., Chopin, G., & Gnanzou, D. (2015). How ‘Big Data’ can make big impact: Findings from a systematic review and a longitudinal case study. International Journal of Production Economics, 165, 234–246.",{"doi":3108},{"id":26,"text":4035,"url":26,"identifiers":4036},"Wang, G., Gunasekaran, A., Ngai, E. W. T., & Papadopoulos, T. (2016). Big data analytics in logistics and supply chain management: Certain investigations for research and applications. International Journal of Production Economics, 176, 98–110.",{"doi":4037},"10.1016\u002Fj.ijpe.2016.03.014",{"id":26,"text":4039,"url":26,"identifiers":4040},"Wang, L., Zhan, J., Luo, C., Zhu, Y., Yang, Q., He, Y., et al. (2014). BigDataBench: A Big Data benchmark suite from internet services. New York: IEEE Xplore.",{},{"id":26,"text":4042,"url":26,"identifiers":4043},"Werdigier, J. (2009). Tesco, British grocer, uses weather to predict sales, New York Times, p.1.",{},{"id":26,"text":4045,"url":26,"identifiers":4046},"Whipple, J. M., & Frankel, R. (2000). Strategic alliance success factors. Journal of Supply Chain Management, 36(3), 21–28.",{"doi":4047},"10.1111\u002Fj.1745-493X.2000.tb00248.x",{"id":26,"text":4049,"url":26,"identifiers":4050},"White, M. (2012). Digital workplaces: Vision and reality. Business Information Review, 29(4), 205–214.",{"doi":4051},"10.1177\u002F0266382112470412",{"id":26,"text":4053,"url":26,"identifiers":4054},"Wong, D. (2012). Data is the next frontier, analytics the new tool: Five trends in big data and analytics, and their implications for innovation and organisations. London: Big Innovation Centre.",{},{"id":26,"text":4056,"url":26,"identifiers":4057},"Yong-Hak, J. (2013). Web of science. Thomson Reuters. http:\u002F\u002Fwokinfo.com\u002Fmedia\u002Fpdf\u002FWoSFS_08_7050.pdf .",{},{"id":26,"text":4059,"url":26,"identifiers":4060},"Yu, F. B., Menachemi, N., Berner, E. S., Allison, J. J., Weissman, N. W., & Houston, T. K. (2009). Full implementation of computerized physician entry and medication-related quality outcomes: A study of 3364 hospitals. American Journal of Medical Quality, 24(4), 278–286.",{"doi":4061},"10.1177\u002F1062860609333626",{"id":26,"text":4063,"url":26,"identifiers":4064},"Zacharia, Z. G., Sanders, N. R., & Nix, N. W. (2011). The emerging role of the third-party logistics provider (3PL) as an orchestrator. Journal of Business Logistics, 32(1), 40–54.",{"doi":4065},"10.1111\u002Fj.2158-1592.2011.01004.x",{"id":26,"text":4067,"url":26,"identifiers":4068},"Zhu, H., Madnick, S. E., Lee, Y. W., & Wang, R. Y. (2014). Data and information quality research: Its evolution and future. London: Taylor and Francis Group LLC.",{}]