[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_2cb48106-3638-4378-8005-88e857cd6841":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:2cb48106-3638-4378-8005-88e857cd6841,\"}":1043},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+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":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\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":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+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":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\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>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","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",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,800],{"id":773,"indexDatabase":774,"url":784,"indexYears":785,"academicFieldIds":786,"indexDatabaseRanking":788},"6ace2085-a177-4a27-b309-8813b832111e",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":781,"publicationTags":782,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":778,"VI":778},"Scopus - Elsevier",{"EN":778,"VI":780},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[783],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[787],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":790,"indexDatabase":791,"url":796,"indexYears":797,"academicFieldIds":798,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":792,"label":793,"description":794,"key":94,"publicationTags":795,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[799],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":881,"manageAffiliations":894,"indexDatabases":910,"url":28,"thumbnailPath":28,"statistic":942,"gsStatistic":28,"type":28,"analyzePriority":28},"2cb48106-3638-4378-8005-88e857cd6841","2024-04-16T06:24:30.434+00:00","2025-11-21T10:01:35.519+00:00",[],"Springer-Science-and-Business-Media-LLC",{"issn":874,"title":876,"eissn":878},{"VOID":875},"0025-5610",{"EN":877},"Springer Science and Business Media LLC",{"VOID":879},"1436-4646","PENDING",[882,888],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":884,"label":885,"description":887,"parentId":28,"standard":28,"scholarHubFieldId":28},"aae089e7-8b62-4df4-ab86-aada3693b3f8",[],{"EN":886},"Software",{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":890,"label":891,"description":893,"parentId":28,"standard":28,"scholarHubFieldId":28},"37634bef-3565-4ad6-b1ba-c43cf4d196be",[],{"EN":892},"Mathematics (miscellaneous)",{},[895,903],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":897,"slug":28,"properties":898,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":901,"statistic":28},"fcaf0b87-0747-4368-8bc5-e516b566d17b",[],{"title":899},{"EN":900},"Springer-Verlag GmbH and Co. KG",[902],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":904,"createTime":28,"updateTime":28,"relativeEntities":905,"slug":28,"properties":906,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":909,"statistic":28},"869fc292-62ea-48f4-960e-51fea58b02ba",[],{"title":907},{"EN":908},"Springer Heidelberg",[902],[911,929],{"id":912,"indexDatabase":913,"url":924,"indexYears":28,"academicFieldIds":925,"indexDatabaseRanking":28},"7a8820a6-5973-47dd-b446-2085f5ed8729",{"id":914,"createTime":28,"updateTime":28,"relativeEntities":915,"label":916,"description":918,"key":921,"publicationTags":922,"standard":28},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":917,"VI":917},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":919,"VI":920},"SCIE database","Cơ sở dữ liệu SCIE","scie",[923,813],"SCIE","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0025-5610",[926,927,928],"ef99e6f3-ace4-49a6-aa47-d5e24f7d2768","213b6fd5-fb87-42bb-b348-eda0690eebc4","0a89cee9-2df6-4b14-8fcb-700fd0044c25",{"id":930,"indexDatabase":931,"url":936,"indexYears":937,"academicFieldIds":938,"indexDatabaseRanking":941},"6c359532-11f7-4b02-be51-bf38d7400acd",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":932,"label":933,"description":934,"key":781,"publicationTags":935,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28512","1971-2025",[939,940],"f8ab36fc-bc72-48f2-a425-9f3e042f2272","825d41e1-f1f9-472e-aa11-78b85d501870","SCOPUS__Q1",{"impactFactor":32,"impactFactorByYear":943,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":948,"totalCitation":954,"totalCitationByYear":955,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":999,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},0.94,0.59,408,3375,{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},108,81,69,96,115,49072,{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},832,249,2240,1320,216,505,341,1094,340,457,824,369,564,7948,583,533,1362,696,806,709,835,480,631,500,2182,744,903,2930,1557,8780,499,391,902,1143,434,479,271,656,565,453,300,245,14.54,{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},0.96,9.38,19.35,6.07,40.73,20.62,3.66,9.18,6.43,18.86,6.8,9.52,15.26,7.85,9.25,144.51,6.2,17.69,7.65,10.47,11.25,18.98,10.69,8.33,47.43,21.26,20.52,27.13,3.71,23.59,117.07,6.84,10.57,20.04,15.66,8.51,6.39,3.39,8.1,7.06,3.55,1.9,0.76,{"meta":1044,"data":1046},{"total":1045},"3389",[1047,1165,1281,1442,1568,1655,1777,1846,1951,2060],{"id":1048,"createTime":1049,"updateTime":1050,"relativeEntities":1051,"slug":1052,"properties":1053,"entityType":1062,"verifyStatus":26,"verifyTime":1050,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1064,"fullTextUrl":28,"authors":1065,"publicationType":1110,"publisherRelationship":1111,"citationCount":28,"citationInfo":28,"publishDate":1161,"publishYear":1162,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1163,"openAccess":28,"references":28,"isForceReanalyzing":1164},"003da0c6-2e19-42ad-b233-0a060aeca700","2024-01-24T11:15:23.667+00:00","2025-02-21T22:25:35.798+00:00",[],"Modeling-combinatorial-disjunctive-constraints-via-junction-trees",{"abstract":1054,"title":1056,"references":1058,"doi":1060},{"EN":1055},"We introduce techniques to build small ideal mixed-integer programming (MIP) formulations of combinatorial disjunctive constraints (CDCs) via the independent branching scheme. We present a novel pairwise IB-representable class of CDCs, CDCs admitting junction trees, and provide a combinatorial procedure to build MIP formulations for those constraints. Generalized special ordered sets (\n              \n                \n              \n              $${\\text {SOS}}k$$\n              \n            ) can be modeled by CDCs admitting junction trees and we also obtain MIP formulations of \n              \n                \n              \n              $${\\text {SOS}}k$$\n              \n            . Furthermore, we provide a novel ideal extended formulation of any combinatorial disjunctive constraints with fewer auxiliary binary variables with an application in planar obstacle avoidance.",{"EN":1057},"Modeling combinatorial disjunctive constraints via junction trees",{"VOID":1059},"Adams, W.P., Henry, S.M.: Base-2 expansions for linearizing products of functions of discrete variables. Oper. Res. 60(6), 1477–1490 (2012)\nAmilhastre, J., Vilarem, M.C., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discret. Appl. Math. 86(2–3), 125–144 (1998)\nBalas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17(6), 941–957 (1969)\nBalas, E.: Disjunctive programming: cutting planes from logical conditions. In: Nonlinear Programming, pp. 279–312. Elsevier, New York (1975)\nBalas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3–51 (1979)\nBalas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1–3), 3–44 (1998)\nBeale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. OR 69(447–454), 99 (1970)\nBertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43(1), 1–22 (2009)\nBiegler, L.T., Grossmann, I.E., Westerberg, A.W.: Systematic Methods for Chemical Process Design. Prentice Hall, Old Tappan, NJ (United States) (1997)\nBondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2008)\nde Caen, D., Gregory, D.A., Pullman, N.J.: The boolean rank of zero-one matrices. In: Proceedings of the Third Caribbean Conference on Combinatorics and Computing, Barbados, pp. 169–173 (1981)\nChalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A.: Nearly tight approximability results for minimum biclique cover and partition. In: European Symposium on Algorithms, pp. 235–246. Springer (2014)\nChang, T.J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13), 1271–1302 (2000)\nDai, H., Izatt, G., Tedrake, R.: Global inverse kinematics via mixed-integer convex optimization. Int. J. Robot. Res. 38(12–13), 1420–1441 (2019)\nDe Berg, M.T., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Cham (2000)\nDeits, R., Tedrake, R.: Footstep planning on uneven terrain with mixed-integer convex optimization. In: 2014 IEEE-RAS International Conference on Humanoid Robots, pp. 279–286. IEEE (2014)\nDeits, R., Tedrake, R.: Efficient mixed-integer planning for uavs in cluttered environments. In: 2015 IEEE International Conference on Robotics and Automation (ICRA), pp. 42–49. IEEE (2015)\nDeo, N.: Graph Theory with Applications to Engineering and Computer Science. Courier Dover Publications, Mineola, New York (2017)\nGuo, K., Huynh, T., Macchia, M.: The biclique covering number of grids. Electron. J. Comb. (2019). https:\u002F\u002Fdoi.org\u002F10.37236\u002F8316\nHuchette, J., Vielma, J.P.: A combinatorial approach for small and strong formulations of disjunctive constraints. Math. Oper. Res. 44(3), 793–820 (2019)\nHuchette, J., Vielma, J.P.: Nonconvex piecewise linear functions: advanced formulations and simple modeling tools. Oper. Res. (2022). https:\u002F\u002Fdoi.org\u002F10.1287\u002Fopre.2019.1973\nJeroslow, R.G., Lowe, J.K.: Modelling with integer variables. In: Mathematical Programming at Oberwolfach II, pp. 167–184. Springer, Cham (1984)\nKaruppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650–673 (2006)\nKis, T., Horváth, M.: Ideal, non-extended formulations for disjunctive constraints admitting a network representation. Math. Program. (2021). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10107-021-01652-z\nKravitz, D.: Two comments on minimum spanning trees. Bull. ICA 49, 7–10 (2007)\nKuindersma, S., Deits, R., Fallon, M., Valenzuela, A., Dai, H., Permenter, F., Koolen, T., Marion, P., Tedrake, R.: Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot. Auton. Robots 40(3), 429–455 (2016)\nMellinger, D., Kushleyev, A., Kumar, V.: Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams. In: 2012 IEEE International Conference on Robotics and Automation, pp. 477–483. IEEE (2012)\nMinkowski, H.: Allgemeine lehrsatze uber die konvexen polyeder. Nachr. Ges. Wiss. Gott. Math. Phys. KL 1897, 198–219 (1897)\nMuldoon, F.M., Adams, W.P., Sherali, H.D.: Ideal representations of lexicographic orderings and base-2 expansions of integer variables. Oper. Res. Lett. 41(1), 32–39 (2013)\nMüller, H.: On edge perfectness and classes of bipartite graphs. Discret. Math. 149(1–3), 159–187 (1996)\nOrlin, J.: Contentment in graph theory: covering graphs with cliques. In: Indagationes Mathematicae (Proceedings), pp. 406–424. Elsevier, New York (1977)\nPinto, J.M., Grossmann, I.E.: A continuous time mixed integer linear programming model for short term scheduling of multistage batch plants. Ind. Eng. Chem. Res. 34(9), 3037–3051 (1995)\nProdan, I., Stoican, F., Olaru, S., Niculescu, S.I.: Mixed-Integer Representations in Control Design: Mathematical Foundations and Applications. Springer, Cham (2016)\nRaman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563–578 (1994)\nTuza, Z.: Covering of graphs by complete bipartite subgraphs; complexity of 0–1 matrices. Combinatorica 4(1), 111–116 (1984)\nVielma, J.P.: Mixed integer linear programming formulation techniques. Siam Rev. 57(1), 3–57 (2015)\nVielma, J.P.: Embedding formulations and complexity for unions of polyhedra. Manag. Sci. 64(10), 4721–4734 (2018)\nVielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303–315 (2010)\nVielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. Inf. J. Comput. 20(3), 438–450 (2008)\nVielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1), 49–72 (2011)\nWeyl, H.: Elementare theorie der konvexen polyeder. Comment. Math. Helv. 7(1), 290–306 (1934)",{"VOID":1061},"10.1007\u002Fs10107-023-01955-3","PUBLICATION","Auto Verify","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10107-023-01955-3",[1066,1082,1095],{"id":1067,"sortIndex":32,"researcher":28,"roles":1068,"affiliations":1070,"properties":1079,"displayName":1081,"givenName":28,"familyName":28},"58b5b4f2-e75c-4429-96c0-6b9bdb5cb8e1",[1069],"AUTHOR",[1071],{"id":1072,"sortIndex":32,"affiliation":1073,"properties":28},"382afb3a-a58c-48dc-89e5-92e2938afc55",{"id":1072,"createTime":28,"updateTime":28,"relativeEntities":1074,"slug":28,"properties":1075,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1078,"statistic":28},[],{"title":1076},{"EN":1077},"Department of Computational Applied Mathematics and Operations Research, Rice University, Houston, USA",[],{"title":1080},{"VI":1081},"Bochuan Lyu",{"id":1083,"sortIndex":40,"researcher":28,"roles":1084,"affiliations":1085,"properties":1092,"displayName":1094,"givenName":28,"familyName":28},"fdfae10e-32ad-4bf9-bec8-0cbc26109424",[1069],[1086],{"id":1072,"sortIndex":32,"affiliation":1087,"properties":28},{"id":1072,"createTime":28,"updateTime":28,"relativeEntities":1088,"slug":28,"properties":1089,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1091,"statistic":28},[],{"title":1090},{"EN":1077},[],{"title":1093},{"VI":1094},"Illya V. Hicks",{"id":1096,"sortIndex":123,"researcher":28,"roles":1097,"affiliations":1098,"properties":1107,"displayName":1109,"givenName":28,"familyName":28},"07a524bb-775d-4c70-a3a5-1868861b3a9b",[1069],[1099],{"id":1100,"sortIndex":32,"affiliation":1101,"properties":28},"53c040f4-acee-4248-b1da-165b8179ab12",{"id":1100,"createTime":28,"updateTime":28,"relativeEntities":1102,"slug":28,"properties":1103,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1106,"statistic":28},[],{"title":1104},{"VI":1105},"Google Research, Cambridge, USA",[],{"title":1108},{"VI":1109},"Joey Huchette","ARTICLE",{"url":1064,"publisher":1112,"properties":1158},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1113,"slug":872,"properties":1114,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1118,"manageAffiliations":1127,"indexDatabases":1138,"url":28,"thumbnailPath":28,"statistic":1153,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1115,"title":1116,"eissn":1117},{"VOID":875},{"EN":877},{"VOID":879},[1119,1123],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1120,"label":1121,"description":1122,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1124,"label":1125,"description":1126,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1128,1133],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1129,"slug":28,"properties":1130,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1132,"statistic":28},[],{"title":1131},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1134,"slug":28,"properties":1135,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1137,"statistic":28},[],{"title":1136},{"EN":908},[902],[1139,1146],{"id":912,"indexDatabase":1140,"url":924,"indexYears":28,"academicFieldIds":1145,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1141,"label":1142,"description":1143,"key":921,"publicationTags":1144,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1147,"url":936,"indexYears":937,"academicFieldIds":1152,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1148,"label":1149,"description":1150,"key":781,"publicationTags":1151,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1154,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1155,"totalCitation":954,"totalCitationByYear":1156,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1157,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1159},{"VOID":1160},"1-29","2023-04-26",2023,[923,941],false,{"id":1166,"createTime":1167,"updateTime":1168,"relativeEntities":1169,"slug":1170,"properties":1171,"entityType":1062,"verifyStatus":26,"verifyTime":1180,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1181,"fullTextUrl":28,"authors":1182,"publicationType":1110,"publisherRelationship":1226,"citationCount":28,"citationInfo":28,"publishDate":1278,"publishYear":1279,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1280,"openAccess":28,"references":28,"isForceReanalyzing":1164},"005c984f-659c-4064-997e-c37db1e3d4fd","2024-02-07T07:46:33.087+00:00","2025-01-11T12:07:05.074+00:00",[],"-ell-1-Sparsity-approximation-bounds-for-packing-integer-programs",{"abstract":1172,"title":1174,"references":1176,"doi":1178},{"EN":1173},"We consider approximation algorithms for packing integer programs (PIPs) of the form \n$$\\max \\{\\langle c, x\\rangle : Ax \\le b, x \\in \\{0,1\\}^n\\}$$\n\n where A, b and c are nonnegative. We let \n$$W = \\min _{i,j} b_i \u002F A_{i,j}$$\n\n denote the width of A which is at least 1. Previous work by Bansal et al. (Theory Comput 8(24):533–565, 2012) obtained an \n$$\\varOmega (\\frac{1}{\\varDelta _0^{1\u002F\\lfloor W \\rfloor }})$$\n\n-approximation ratio where \n$$\\varDelta _0$$\n\n is the maximum number of nonzeroes in any column of A (in other words the \n$$\\ell _0$$\n\n-column sparsity of A). They raised the question of obtaining approximation ratios based on the \n$$\\ell _1$$\n\n-column sparsity of A (denoted by \n$$\\varDelta _1$$\n\n) which can be much smaller than \n$$\\varDelta _0$$\n\n. Motivated by recent work on covering integer programs (Chekuri and Quanrud, in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1596–1615. SIAM, 2019; Chen et al., in: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1984–2003. SIAM, 2016) we show that simple algorithms based on randomized rounding followed by alteration, similar to those of Bansal et al. (Theory Comput 8(24):533–565, 2012) (but with a twist), yield approximation ratios for PIPs based on \n$$\\varDelta _1$$\n\n. First, following an integrality gap example from (Theory Comput 8(24):533–565, 2012), we observe that the case of \n$$W=1$$\n\n is as hard as maximum independent set even when \n$$\\varDelta _1 \\le 2$$\n\n. In sharp contrast to this negative result, as soon as width is strictly larger than one, we obtain positive results via the natural LP relaxation. For PIPs with width \n$$W = 1 + \\epsilon $$\n\n where \n$$\\epsilon \\in (0,1]$$\n\n, we obtain an \n$$\\varOmega (\\epsilon ^2\u002F\\varDelta _1)$$\n\n-approximation. In the large width regime, when \n$$W \\ge 2$$\n\n, we obtain an \n$$\\varOmega ((\\frac{1}{1 + \\varDelta _1\u002FW})^{1\u002F(W-1)})$$\n\n-approximation. We also obtain a \n$$(1-\\epsilon )$$\n\n-approximation when \n$$W = \\varOmega (\\frac{\\log (\\varDelta _1\u002F\\epsilon )}{\\epsilon ^2})$$\n\n. Viewing the rounding algorithms as contention resolution schemes, we obtain approximation algorithms in the more general setting when the objective is a non-negative submodular function.",{"EN":1175},"$$\\ell _1$$ -Sparsity approximation bounds for packing integer programs",{"VOID":1177},"Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: Solving packing integer programs via randomized rounding with alterations. Theory Comput. 8(24), 533–565 (2012). https:\u002F\u002Fdoi.org\u002F10.4086\u002Ftoc.2012.v008a024\nBuchbinder, N., Feldman, M.: Constrained submodular maximization via a nonsymmetric technique. Math. Oper. Res. 44(3), 988–1005 (2019)\nChan, T.M.: Approximation schemes for 0–1 knapsack. In: 1st Symposium on Simplicity in Algorithms (2018)\nChekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837–851 (2004)\nChekuri, C., Quanrud, K.: On approximating (sparse) covering integer programs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1596–1615. SIAM (2019)\nChekuri, C., Vondrak, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 575–584. IEEE (2010)\nChekuri, C., Vondrák, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1080–1097. SIAM (2011)\nChekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831–1879 (2014)\nChen, A., Harris, D.G., Srinivasan, A.: Partial resampling to approximate covering integer programs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1984–2003. SIAM (2016)\nEne, A., Nguyen, H.L.: Constrained submodular maximization: beyond 1\u002Fe. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 248–257. IEEE (2016)\nFeldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 570–579. IEEE (2011)\nFrieze, A., Clarke, M.: Approximation algorithms for the m-dimensional 0–1 knapsack problem: worst-case and probabilistic analyses. Eur. J. Oper. Res. 15(1), 100–109 (1984)\nHarvey, N.J.: A note on the discrepancy of matrices with bounded row and column sums. Discrete Math. 338(4), 517–521 (2015)\nHåstad, J.: Clique is hard to approximate within \\(n^{1- \\epsilon }\\). Acta Math. 182(1), 105–142 (1999)\nHazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20–39 (2006)\nMitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)\nPritchard, D.: Approximability of sparse integer programs. In: European Symposium on Algorithms, pp. 83–94. Springer (2009)\nPritchard, D., Chakrabarty, D.: Approximability of sparse integer programs. Algorithmica 61(1), 75–93 (2011)\nRaghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365–374 (1987)\nSrinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29(2), 648–670 (1999)\nTrevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453–461. ACM (2001)\nVondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 67–74. ACM (2008)\nZuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681–690. ACM (2006)",{"VOID":1179},"10.1007\u002Fs10107-020-01472-7","2025-01-11T12:07:05.073+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10107-020-01472-7",[1183,1198,1213],{"id":1184,"sortIndex":32,"researcher":28,"roles":1185,"affiliations":1186,"properties":1195,"displayName":1197,"givenName":28,"familyName":28},"4213015f-e249-410c-8d8a-ce994f96f315",[1069],[1187],{"id":1188,"sortIndex":32,"affiliation":1189,"properties":28},"19c6efc2-4735-47c3-9fd8-2f2ece7fd413",{"id":1188,"createTime":28,"updateTime":28,"relativeEntities":1190,"slug":28,"properties":1191,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1194,"statistic":28},[],{"title":1192},{"VI":1193},"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA",[],{"title":1196},{"VI":1197},"Chandra Chekuri",{"id":1199,"sortIndex":40,"researcher":28,"roles":1200,"affiliations":1201,"properties":1210,"displayName":1212,"givenName":28,"familyName":28},"c0b108dd-a916-4687-810e-20d8d975a6b2",[1069],[1202],{"id":1203,"sortIndex":32,"affiliation":1204,"properties":28},"9b3b70e8-d0d9-4d23-8690-926c9c356ab7",{"id":1203,"createTime":28,"updateTime":28,"relativeEntities":1205,"slug":28,"properties":1206,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1209,"statistic":28},[],{"title":1207},{"VI":1208},"Department of Computer Science, Purdue University, West Lafayette, USA",[],{"title":1211},{"VI":1212},"Kent Quanrud",{"id":1214,"sortIndex":123,"researcher":28,"roles":1215,"affiliations":1216,"properties":1223,"displayName":1225,"givenName":28,"familyName":28},"12ebbfe2-9247-4589-a2e1-73ba3f8aa678",[1069],[1217],{"id":1188,"sortIndex":32,"affiliation":1218,"properties":28},{"id":1188,"createTime":28,"updateTime":28,"relativeEntities":1219,"slug":28,"properties":1220,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1222,"statistic":28},[],{"title":1221},{"VI":1193},[],{"title":1224},{"VI":1225},"Manuel R. Torres",{"url":1181,"publisher":1227,"properties":1273},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1228,"slug":872,"properties":1229,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1233,"manageAffiliations":1242,"indexDatabases":1253,"url":28,"thumbnailPath":28,"statistic":1268,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1230,"title":1231,"eissn":1232},{"VOID":875},{"EN":877},{"VOID":879},[1234,1238],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1235,"label":1236,"description":1237,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1239,"label":1240,"description":1241,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1243,1248],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1244,"slug":28,"properties":1245,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1247,"statistic":28},[],{"title":1246},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1249,"slug":28,"properties":1250,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1252,"statistic":28},[],{"title":1251},{"EN":908},[902],[1254,1261],{"id":912,"indexDatabase":1255,"url":924,"indexYears":28,"academicFieldIds":1260,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1256,"label":1257,"description":1258,"key":921,"publicationTags":1259,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1262,"url":936,"indexYears":937,"academicFieldIds":1267,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1263,"label":1264,"description":1265,"key":781,"publicationTags":1266,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1269,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1270,"totalCitation":954,"totalCitationByYear":1271,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1272,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1274,"volume":1276},{"VOID":1275},"195-214",{"VOID":1277},"183","2020-02-13",2020,[923,941],{"id":1282,"createTime":1283,"updateTime":1283,"relativeEntities":1284,"slug":28,"properties":1285,"entityType":1062,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1294,"fullTextUrl":28,"authors":1295,"publicationType":1110,"publisherRelationship":1390,"citationCount":28,"citationInfo":28,"publishDate":1440,"publishYear":1162,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1441,"openAccess":28,"references":28,"isForceReanalyzing":1164},"0097c5fa-1959-415a-bd89-150fa8e8a741","2024-01-05T18:53:59.839+00:00",[],{"abstract":1286,"title":1288,"references":1290,"doi":1292},{"EN":1287},"By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erdős that the density of any measurable planar set avoiding unit distances is less than 1\u002F4. Our argument implies the upper bound of 0.2470.",{"EN":1289},"The density of planar sets avoiding unit distances",{"VOID":1291},"Ambrus, G., Matolcsi, M.: Density estimates of 1-avoiding sets via higher order correlations. Discrete Comput. Geom. 67, 1245–1256 (2022)\nBachoc, C., Passuello, A., Thiery, A.: The density of sets avoiding distance 1 in Euclidean space. Discrete Comput. Geom. 53, 783–808 (2015)\nBellitto, T., Pêcher, A., Sédillot, A.: On the density of sets of the Euclidean plane avoiding distance 1. Discrete Math. Theor. Comput. Sci. 23(1), 5153 (2021)\nBrass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)\nCranston, D.W., Rabern, L.: The fractional chromatic number of the plane. Combinatorica 37, 837–861 (2017)\nCroft, H.T.: Incidence incidents. Eureka 30, 22–26 (1967)\nDeCorte, E., de Oliveira Filho, F.M., Vallentin, F.: Complete positivity and distance-avoiding sets. Math. Program. 191, 487–558 (2022)\nde Grey, A.: The chromatic number of the plane is at least 5. Geombinatorics 28(1), 18–31 (2018)\nde Oliveira Filho, F.M., Vallentin, F.: Fourier analysis, linear programming, and densities of distance-avoiding sets in \\(\\mathbb{R} ^n\\). J. Eur. Math. Soc. 12, 1417–1428 (2010)\nde Oliveira Filho, F.M., Vallentin, F.M.: A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1. Mathematika 65(3), 785–787 (2019)\nErdős, P.: Problems and results in combinatorial geometry. In: Discrete Geometry and Convexity (New York, 1982), Annals of the New York Academy of Sciences, vol. 440, pp. 1–11. New York Academy of Sciences, New York (1985)\nExoo, G., Ismailescu, D.: The chromatic number of the plane is at least 5: a new proof. Discrete Comput. Geom. 64, 216–226 (2020)\nFalconer, K.J.: The realization of distances in measurable subsets covering \\(\\mathbb{R}^n\\). J. Comb. Theory Ser. A 31(2), 184–189 (1981)\nFisher, D., Ullman, D.: The fractional chromatic number of the plane. Geombinatorics 2, 8–12 (1992)\nGurobi Optimization, LLC, Gurobi Optimizer Reference Manual. https:\u002F\u002Fwww.gurobi.com (2022)\nHadwiger, H.: Überdeckung des Euklidischen Raumes durch kongruente Mengen. Port. Math. 4, 238–242 (1945)\nHarris, C.R., Millman, K.J., Van Der Walt, S.J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N.J., Kern, R.: Array programming with NumPy. Nature 585(7825), 357–362 (2020)\nhttps:\u002F\u002Farxiv.org\u002Fabs\u002F2207.14179\nhttps:\u002F\u002Fbit.ly\u002Funit-distances\nKatznelson, Y.: An Introduction to Harmonic Analysis. Wiley, New York (1968)\nKeleti, T., Matolcsi, M., de Oliveira Filho, F.M., Ruzsa, I.Z.: Better bounds for planar sets avoiding unit distances. Discrete Comput. Geom. 55, 642–661 (2016)\nLarman, D.G., Rogers, C.A.: The realization of distances within sets in Euclidean space. Mathematika 19, 1–24 (1972)\nMeurer, A., Smith, C.P., Paprocki, M., Certik, O., Kirpichev, S.B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J.K., Singh, S., Rathnayake, T.: SymPy: symbolic computing in Python. PeerJ Comput. Sci. 3, 2376–5992 (2017)\nMOSEK ApS, MOSEK Optimizer API for Python 9.3.20. https:\u002F\u002Fdocs.mosek.com\u002Flatest\u002Fpythonapi\u002Findex.html (2022)\nMoser, L.: Poorly formulated unsolved problems of combinatorial geometry. Mimeographed (1966)\nMoser, L., Moser, W.: Solution to problem 10. Can. Math. Bull. 4, 187–189 (1961)\nParts, J.: PolyMath16, Comment 37575. https:\u002F\u002Fdustingmixon.wordpress.com\u002F2021\u002F02\u002F01\u002Fpolymath16-seventeenth-thread-declaring-victory\u002F#comment-37575\nPolyMath16: Hadwiger-Nelson problem. https:\u002F\u002Fasone.ai\u002Fpolymath\u002Findex.php?title=Hadwiger-Nelson_problem (2022)\nScheinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Courier Corporation (2011)\nSchoenberg, I.J.: Metric spaces and completely monotone functions. Ann. Math. 39, 811–841 (1938)\nSoifer, A.: The mathematical coloring book. Mathematics of coloring and the colorful life of its creators. With forewords by Branko Grünbaum, Peter D. Johnson, Jr. and Cecil Rousseau. Springer, New York (2009)\nSzékely, L.A.: Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space. Combinatorica 4, 213–218 (1984)\nSzékely, L.A.: Erdős on unit distances and the Szemerédi–Trotter theorems. In: Halász, G., Lovász, L., Simonovits, M., Sós, V.T. (eds.) Paul Erdős and His Mathematics. II. Bolyai Society Mathematical Studies, vol. 11, pp. 646–666. János Bolyai Mathematical Society, Springer-Verlag, Berlin (2002)\nWatson, G.N.: A Treatise on the Theory of Bessel Functions. Cambridge University Press, Cambridge (1922)",{"VOID":1293},"10.1007\u002Fs10107-023-02012-9","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10107-023-02012-9",[1296,1320,1342,1364,1377],{"id":1297,"sortIndex":32,"researcher":28,"roles":1298,"affiliations":1299,"properties":1317,"displayName":1319,"givenName":28,"familyName":28},"7ca33a8a-5ee6-4df9-ad19-c96197947baf",[1069],[1300,1308],{"id":1301,"sortIndex":32,"affiliation":1302,"properties":28},"6330026f-29c8-4b3a-90eb-92377fe9b74c",{"id":1301,"createTime":28,"updateTime":28,"relativeEntities":1303,"slug":28,"properties":1304,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1307,"statistic":28},[],{"title":1305},{"EN":1306},"Department of Geometry, Bolyai Institute, University of Szeged, Szeged, Hungary",[],{"id":1309,"sortIndex":40,"affiliation":1310,"properties":1316},"e96da8da-c817-4fec-bc99-6b0c49ca86d1",{"id":1309,"createTime":28,"updateTime":28,"relativeEntities":1311,"slug":28,"properties":1312,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1315,"statistic":28},[],{"title":1313},{"VI":1314},"HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary",[],{},{"title":1318},{"VI":1319},"Gergely Ambrus",{"id":1321,"sortIndex":40,"researcher":28,"roles":1322,"affiliations":1323,"properties":1339,"displayName":1341,"givenName":28,"familyName":28},"0e465ebc-18c8-46dd-b3c2-9a39c2ca80ad",[1069],[1324,1330],{"id":1309,"sortIndex":32,"affiliation":1325,"properties":28},{"id":1309,"createTime":28,"updateTime":28,"relativeEntities":1326,"slug":28,"properties":1327,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1329,"statistic":28},[],{"title":1328},{"VI":1314},[],{"id":1331,"sortIndex":40,"affiliation":1332,"properties":1338},"64ab82f7-3bf5-4370-af88-80dfcf80a9d5",{"id":1331,"createTime":28,"updateTime":28,"relativeEntities":1333,"slug":28,"properties":1334,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1337,"statistic":28},[],{"title":1335},{"VI":1336},"Department of Computer Science, Institute of Mathematics, Eötvös Loránd University, Budapest, Hungary",[],{},{"title":1340},{"VI":1341},"Adrián Csiszárik",{"id":1343,"sortIndex":123,"researcher":28,"roles":1344,"affiliations":1345,"properties":1361,"displayName":1363,"givenName":28,"familyName":28},"54f64533-a271-4001-9417-a13f8a8525f5",[1069],[1346,1352],{"id":1309,"sortIndex":32,"affiliation":1347,"properties":28},{"id":1309,"createTime":28,"updateTime":28,"relativeEntities":1348,"slug":28,"properties":1349,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1351,"statistic":28},[],{"title":1350},{"VI":1314},[],{"id":1353,"sortIndex":40,"affiliation":1354,"properties":1360},"cad7a86a-fa52-476a-9142-62c08f4ea8a2",{"id":1353,"createTime":28,"updateTime":28,"relativeEntities":1355,"slug":28,"properties":1356,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1359,"statistic":28},[],{"title":1357},{"VI":1358},"Department of Analysis, Institute of Mathematics, Budapest University of Technology and Economics, Budapest, Hungary",[],{},{"title":1362},{"VI":1363},"Máté Matolcsi",{"id":1365,"sortIndex":42,"researcher":28,"roles":1366,"affiliations":1367,"properties":1374,"displayName":1376,"givenName":28,"familyName":28},"5b78b7fc-1bb6-4377-8d97-e29efe8791ac",[1069],[1368],{"id":1309,"sortIndex":32,"affiliation":1369,"properties":28},{"id":1309,"createTime":28,"updateTime":28,"relativeEntities":1370,"slug":28,"properties":1371,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1373,"statistic":28},[],{"title":1372},{"VI":1314},[],{"title":1375},{"VI":1376},"Dániel Varga",{"id":1378,"sortIndex":45,"researcher":28,"roles":1379,"affiliations":1380,"properties":1387,"displayName":1389,"givenName":28,"familyName":28},"1a03cdef-5978-42b0-abbd-75b7ed1d3d02",[1069],[1381],{"id":1309,"sortIndex":32,"affiliation":1382,"properties":28},{"id":1309,"createTime":28,"updateTime":28,"relativeEntities":1383,"slug":28,"properties":1384,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1386,"statistic":28},[],{"title":1385},{"VI":1314},[],{"title":1388},{"VI":1389},"Pál Zsámboki",{"url":1294,"publisher":1391,"properties":1437},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1392,"slug":872,"properties":1393,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1397,"manageAffiliations":1406,"indexDatabases":1417,"url":28,"thumbnailPath":28,"statistic":1432,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1394,"title":1395,"eissn":1396},{"VOID":875},{"EN":877},{"VOID":879},[1398,1402],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1399,"label":1400,"description":1401,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1403,"label":1404,"description":1405,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1407,1412],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1408,"slug":28,"properties":1409,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1411,"statistic":28},[],{"title":1410},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1413,"slug":28,"properties":1414,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1416,"statistic":28},[],{"title":1415},{"EN":908},[902],[1418,1425],{"id":912,"indexDatabase":1419,"url":924,"indexYears":28,"academicFieldIds":1424,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1420,"label":1421,"description":1422,"key":921,"publicationTags":1423,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1426,"url":936,"indexYears":937,"academicFieldIds":1431,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1427,"label":1428,"description":1429,"key":781,"publicationTags":1430,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1433,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1434,"totalCitation":954,"totalCitationByYear":1435,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1436,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1438},{"VOID":1439},"1-25","2023-10-06",[923,941],{"id":1443,"createTime":1444,"updateTime":1445,"relativeEntities":1446,"slug":1447,"properties":1448,"entityType":1062,"verifyStatus":26,"verifyTime":1445,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1457,"fullTextUrl":28,"authors":1458,"publicationType":1110,"publisherRelationship":1513,"citationCount":28,"citationInfo":28,"publishDate":1565,"publishYear":1566,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1567,"openAccess":28,"references":28,"isForceReanalyzing":1164},"00bda3e9-ae2a-4122-8acd-e22585a3938a","2023-12-25T10:48:13.741+00:00","2024-12-18T05:54:03.827+00:00",[],"Deriving-robust-counterparts-of-nonlinear-uncertain-inequalities",{"abstract":1449,"title":1451,"references":1453,"doi":1455},{"EN":1450},"In this paper we provide a systematic way to construct the robust counterpart of a nonlinear uncertain inequality that is concave in the uncertain parameters. We use convex analysis (support functions, conjugate functions, Fenchel duality) and conic duality in order to convert the robust counterpart into an explicit and computationally tractable set of constraints. It turns out that to do so one has to calculate the support function of the uncertainty set and the concave conjugate of the nonlinear constraint function. Conveniently, these two computations are completely independent. This approach has several advantages. First, it provides an easy structured way to construct the robust counterpart both for linear and nonlinear inequalities. Second, it shows that for new classes of uncertainty regions and for new classes of nonlinear optimization problems tractable counterparts can be derived. We also study some cases where the inequality is nonconcave in the uncertain parameters.",{"EN":1452},"Deriving robust counterparts of nonlinear uncertain inequalities",{"VOID":1454},"AIMMS: Paragon Decision Technology. http:\u002F\u002Fwww.aimms.com\u002Foperations-research\u002Fmathematical-programming\u002Frobust-optimization (2012)\nAnderson, T.W., Darling, D.A.: Asymptotic theory of certain goodness-of-fit criteria based on stochastic processes. Ann. Math. Stat. 23(2), 193–212 (1952)\nAverbakh, I., Zhao, Y.-B.: Explicit reformulations for robust optimization problems with general uncertainty sets. SIAM J. Optim. 18(4), 1436–1466 (2007)\nBen-Tal, A., Ben-Israel, A., Teboulle, M.: Certainty equivalents and information measures: duality and extremal principles. J. Math. Anal. Appl. 157, 211–236 (1991)\nBen-Tal, A., El-Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics (2009)\nBen-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization—Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization (2001)\nBen-Tal, A., den Hertog, D.: Immunizing conic quadratic optimization problems against implementation errors. CentER Discussion Paper 2011–060, Tilburg University, 2011 (to appear in Mathematical Programming)\nBen-Tal, A., den Hertog, D., De Waegenaere, A.M.B., Melenberg, B., Rennen, G.: Robust solutions of optimization problems affected by uncertain probabilities. Manag. Sci. 59(2), 341–357 (2013)\nBen-Tal, A., den Hertog, D., Laurent, M.: Hidden Convexity in Partially Separable Optimization. CentER Discussion Paper 2011-070, Tilburg University (2011)\nBertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464–501 (2011)\nBertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32, 510–516 (2004)\nden Hertog, D.: Interior Point Approach to Linear, Quadratic and Convex Programming. Kluwer, Dordrecht (1994)\nGoh, J., Sim, M.: Robust optimization made easy with ROME. Oper. Res. 59(4), 973–985 (2011)\nGolub, G.H., van Loan, C.F.: Matrix Computations, 2nd edn. Johns Hopkins University Press, London (1989)\nGushchin, A.A.: On an extension of the notion of \\(f\\)-divergence. Theory Probab. Its Appl. 52(3), 439–455 (2008)\nLöfberg, J.: Automatic robust convex programming. Optim. Methods Softw. 27(1), 115–129 (2012)\nNemirovski, A.: Lectures on Robust Convex Optimization. Lecture 2 of Lecture Notes. http:\u002F\u002Fwww2.isye.gatech.edu\u002Fnemirovs\u002FLect2 (2009)\nNesterov, Y.E., Nemirovski, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, Philadelphia (1993)\nRockafellar, R.T.: Convex Analysis. Princeton Press, Princeton (1970)",{"VOID":1456},"10.1007\u002Fs10107-014-0750-8","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10107-014-0750-8",[1459,1483,1498],{"id":1460,"sortIndex":32,"researcher":28,"roles":1461,"affiliations":1462,"properties":1480,"displayName":1482,"givenName":28,"familyName":28},"87891493-333a-4d62-9665-f96feceafe41",[1069],[1463,1471],{"id":1464,"sortIndex":32,"affiliation":1465,"properties":28},"e05eade1-45a2-49fa-b453-dab60f63bb40",{"id":1464,"createTime":28,"updateTime":28,"relativeEntities":1466,"slug":28,"properties":1467,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1470,"statistic":28},[],{"title":1468},{"VI":1469},"Department of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa, Israel",[],{"id":1472,"sortIndex":40,"affiliation":1473,"properties":1479},"5d1f6c8b-db34-408a-bf95-a34abbf83019",{"id":1472,"createTime":28,"updateTime":28,"relativeEntities":1474,"slug":28,"properties":1475,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1478,"statistic":28},[],{"title":1476},{"VI":1477},"CentER Extramural Fellow, CentER, Tilburg University, Tilburg, The Netherlands",[],{},{"title":1481},{"VI":1482},"Aharon Ben-Tal",{"id":1484,"sortIndex":40,"researcher":28,"roles":1485,"affiliations":1486,"properties":1495,"displayName":1497,"givenName":28,"familyName":28},"8b2e3601-ba27-4767-bd8f-d49a6761ba17",[1069],[1487],{"id":1488,"sortIndex":32,"affiliation":1489,"properties":28},"29ddff44-b716-48a4-a2f7-d8f445f0904e",{"id":1488,"createTime":28,"updateTime":28,"relativeEntities":1490,"slug":28,"properties":1491,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1494,"statistic":28},[],{"title":1492},{"VI":1493},"Ticopt, Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands",[],{"title":1496},{"VI":1497},"Dick den Hertog",{"id":1499,"sortIndex":123,"researcher":28,"roles":1500,"affiliations":1501,"properties":1510,"displayName":1512,"givenName":28,"familyName":28},"eb6d8c6c-b385-4237-94b1-65c313151778",[1069],[1502],{"id":1503,"sortIndex":32,"affiliation":1504,"properties":28},"f890cafb-8406-4893-bcec-3f1c586a9247",{"id":1503,"createTime":28,"updateTime":28,"relativeEntities":1505,"slug":28,"properties":1506,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1509,"statistic":28},[],{"title":1507},{"VI":1508},"ORDECSYS, Chêne-Bougeries, Switzerland",[],{"title":1511},{"VI":1512},"Jean-Philippe Vial",{"url":1457,"publisher":1514,"properties":1560},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1515,"slug":872,"properties":1516,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1520,"manageAffiliations":1529,"indexDatabases":1540,"url":28,"thumbnailPath":28,"statistic":1555,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1517,"title":1518,"eissn":1519},{"VOID":875},{"EN":877},{"VOID":879},[1521,1525],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1522,"label":1523,"description":1524,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1526,"label":1527,"description":1528,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1530,1535],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1531,"slug":28,"properties":1532,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1534,"statistic":28},[],{"title":1533},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1536,"slug":28,"properties":1537,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1539,"statistic":28},[],{"title":1538},{"EN":908},[902],[1541,1548],{"id":912,"indexDatabase":1542,"url":924,"indexYears":28,"academicFieldIds":1547,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1543,"label":1544,"description":1545,"key":921,"publicationTags":1546,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1549,"url":936,"indexYears":937,"academicFieldIds":1554,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1550,"label":1551,"description":1552,"key":781,"publicationTags":1553,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1556,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1557,"totalCitation":954,"totalCitationByYear":1558,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1559,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1561,"volume":1563},{"VOID":1562},"265-299",{"VOID":1564},"149","2014-02-16",2014,[923,941],{"id":1569,"createTime":1570,"updateTime":1571,"relativeEntities":1572,"slug":1573,"properties":1574,"entityType":1062,"verifyStatus":26,"verifyTime":1571,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1583,"fullTextUrl":28,"authors":1584,"publicationType":1110,"publisherRelationship":1600,"citationCount":28,"citationInfo":28,"publishDate":1652,"publishYear":1653,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1654,"openAccess":28,"references":28,"isForceReanalyzing":1164},"00c45503-a31d-4e2a-8539-724630fc3552","2024-02-08T15:11:31.603+00:00","2024-12-08T20:53:13.918+00:00",[],"The-boolean-quadric-polytope-Some-characteristics-facets-and-relatives",{"abstract":1575,"title":1577,"references":1579,"doi":1581},{"EN":1576},"We study unconstrained quadratic zero–one programming problems havingn variables from a polyhedral point of view by considering the Boolean quadric polytope QP\n                  n\n                 inn(n+1)\u002F2 dimensions that results from the linearization of the quadratic form. We show that QP\n                  n\n                 has a diameter of one, descriptively identify three families of facets of QP\n                  n\n                 and show that QP\n                  n\n                 is symmetric in the sense that all facets of QP\n                  n\n                 can be obtained from those that contain the origin by way of a mapping. The naive linear programming relaxation QP\n                  n\n                \nLP of QP\n                  n\n                 is shown to possess the Trubin-property and its extreme points are shown to be {0,1\u002F2,1}-valued. Furthermore, O(n\n3) facet-defining inequalities of QP\n                  n\n                 suffice to cut off all fractional vertices of QP\n                  n\n                \nLP, whereas the family of facets described by us has at least O(3\n                  n\n                ) members. The problem is also studied for sparse quadratic forms (i.e. when several or many coefficients are zero) and conditions are given for the previous results to carry over to this case. Polynomially solvable problem instances are discussed and it is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation. In the case that the graph induced by the nonzero coefficients of the quadratic form is series-parallel, a complete linear description of the associated Boolean quadric polytope is given. The relationship of the Boolean quadric polytope associated to sparse quadratic forms with the vertex-packing polytope is discussed as well.",{"EN":1578},"The boolean quadric polytope: Some characteristics, facets and relatives",{"VOID":1580},"E. Balas, “Exténsion de l'algorithme additif à la programmation en nombres entiers et à la programmation non linéaire,”C.R. Acad. Sci. Paris. 258 (1967) 5136–5139.\nE. Balas and J. Mazzola, “Nonlinear 0–1 programming: Parts I & II,”Mathematical Programming 30 (1984) 1–45.\nE. Balas and M. Padberg, “On the set covering problem,”Operations Research 20 (1972) 1152–1161.\nE. Balas and M. Padberg, “Set partitioning: A survey,”SIAM Review 18 (1976) 710–760.\nE. Balas and W. Pulleyblank, “The perfectly matchable subgraph polytope of a bipartite graph,”Networks 13 (1983) 495–516.\nM. Balinski, “On maximum matching, minimum covering and their connections,” in: H. Kuhn (ed.),Proceedings of the Princeton Symposium on Mathematical Programming (Princeton U. Press, Princeton, New Jersey, 1970a) pp. 303–312.\nM. Balinski, “On a selection problem,”Management Science 17 (1970b) 230–231.\nF. Barahona, “A solvable case of quadratic 0–1 programming,”Discrete Applied Mathematics 13 (1986) 23–26.\nF. Barahona, M. Grötschel and R. Mahjoub, “Facets of the bipartite subgraph polytope,”Mathematics of Operations Research 10 (1985) 340–358.\nF. Barahona, M. Jünger and G. Reinelt, “Experiments in quadratic 0–1 programming,” Report no. 7, Institut für Mathematick, Universität Augsburg, November 1987.\nF. Barahona and R. Mahjoub, “On the cut polytope,”Mathematical Programming 36 (1986) 157–173.\nC. Berge,Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).\nM. Boulala and J. Uhry, “Polytope des indépendants d'un graphe série-parallèle,”Discrete Mathematics 7 (1979) 225–243.\nP. Camion, “Characterisation of totally unimodular matrices,”Proceedings American Mathematical Society 6 (1965) 1068–1073.\nV. Chvátal, “On certain polytopes associated with graphs,” Centre de Recherches Mathématiques-238, Université de Montreal, October 1972.\nV. Chvátal, “On certain polytopes associated with graphs,”Journal of Combinatorial Theory B 18 (1975) 138–154.\nM. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope: Parts I & II,” R. 194\u002F195, IASI-CNR, Roma (Italy), October 1987.\nR. Fortet, “L'algèbre de Boole et ses applications en recherche opérationelle,”Cahiers du Centre d'Etudes de Recherche Opérationelle 1 (1959) 5–36.\nR. Fortet, “Applications de l'algèbre de Boole en recherche opérationelle,”Revue Francaise de Recherche Opérationelle 4 (1960) 17–26.\nE. Girlich and M. Kowaljow,Nichtlineare Diskrete Optimierung (Akademie-Verlag, Berlin, 1981).\nM. Grötschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–191.\nM. Grötschel, L. Lovasz and A. Schrijver, “Polynomial algorithms for perfect graphs,”Annals of Discrete Mathematics 21 (1984) 325–356.\nM. Grötschel and Y. Wakabayashi, “Facets of the clique-partitioning polytope,” Report no. 6, Institut für Mathematik, Universität Augsburg, June 1987.\nP. Hammer (Ivanescu), “Some network flow problems solved with pseudo-boolean programming,”Operations Research 13 (1965) 388–399.\nP. Hammer (Ivanescu) and Y. Rosenberg, “Application of pseudo-boolean programming to the theory of graphs,”Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 3 (1967) 163–176.\nP. Hammer, P. Hansen and B. Simeone, “Roof duality, complementation and persistency in quadratic 0–1 programming,”Mathematical Programming 28 (1984) 121–155.\nP. Hansen, “Methods of nonlinear 0–1 programming,”Annals of Discrete Mathematics 5 (1979) 53–70.\nN. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.\nL. Khachiyan, “A polynomial algorithm in linear programming,”Soviet Math. Doklady 20 (1979) 191–194.\nE. Lawler, “The quadratic assignment problem,”Management Science 9 (1963) 586–599.\nR. Mahjoub, “On the stable set polytope of a series-parallel graph,”Mathematical Programming 40 (1988) 53–57.\nG. Nemhauser and L. Trotter, “Vertex packings: Structural properties and algorithms,”Mathematical Programming 8 (1975) 232–248.\nM. Padberg, “Essays in integer programming,” PhD thesis, GSIA, Carnegie-Mellon University, Pittsburgh, April 1971.\nM. Padberg, “On the facial structure of set packing polyhedra,” Report I-13, International Institute of Management, Berlin (West), April 1972a.\nM. Padberg, “On the adjacent vertices cut,” International Institute of Management, Berlin (West), May 1972b.\nM. Padberg, “On the facial structure of set packing polyhedra,”Mathematical Programming 5 (1973) 199–216.\nM. Padberg, “A note on zero–one programmin,”Operations Research 23 (1975) 833–837.\nM. Padberg, “Almost integral polyhedra related to certain combinatorial optimization problems,”Linear Algebra and Its Applications 15 (1956) 69–88.\nM. Padberg, “On the complexity of set packing polyhedra,”Annals of Discrete Mathematics 1 (1977) 421–434.\nM. Padberg, “Zero–one decision problems,” GBA-Report No. 76-29, April 1976, New York University. Published (in German) in: M. Beckmann et al. (eds.),Handwörterbuch der Mathematischen Wirtschafts-wissenschaften (Gabler-Verlag, Wiesbaden, 1978) pp. 187–229.\nM. Padberg, “Covering, packing and knapsack problems,”Annals of Discrete Mathematics 4 (1979) 265–287.\nM. Padberg, “Total unimodularity and the Euler-subgraph problem,”Operations Research Letters 7 (1988) 173–179.\nM. Padberg and M.R. Rao, “The travelling salesman problem and a class of polyhedra of diameter two,”Mathematical Programming 7 (1974) 32–45.\nM. Padberg and M.R. Rao, “The Russian method for linear inequalities III: Bounded integer programming,” July 1981. Report 81-39, GBA, New York University, New York.\nM. Padberg and G. Rinaldi, “Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut,”Operations Research Letters 6 (1987) 1–7.\nJ. Picard and D. Ratliff, “Minimum cuts and related problems,”Networks 5 (1975) 357–370.\nJ. Rhys, “A selection problem of shared fixed costs and networks,”Management Science 7 (1970) 200–207.\nL. Trotter, “Solution characteristics and algorithms for vertex packings,” PhD thesis, Dept. for Operations Research, Cornell University, Ithaca, NY, January 1973.\nL. Trotter, “A class of facet-producing graphs for vertex packing polytopes,”Discrete Mathematics 12 (1975) 373–391.\nV. Trubin, “On a method of solution of integer linear programming problems of a special kind,”Soviet Mathematics Doklady 10 (1969) 1544–1546.\nA. Williams, “Quadratic 0–1 programming using the roof dual with computational results,” RUTCOR Report 8-85, Rutgers University, New Brunswick, NJ, 1985.\nL. Wolsey, “Further facet generating procedures for vertex packing polytopes,”Mathematical Programming 11 (1976) 158–163.\nV. Yemelichev, M. Kovalev and M. Kraftsov,Polytopes, Graphs and Optimization (Cambridge University Press, Cambridge, 1985).\nE. Zemel, “Lifting the facets of zero–one polytopes,”Mathematical Programming 15 (1978) 268–277.",{"VOID":1582},"10.1007\u002FBF01589101","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01589101",[1585],{"id":1586,"sortIndex":32,"researcher":28,"roles":1587,"affiliations":1588,"properties":1597,"displayName":1599,"givenName":28,"familyName":28},"dd73fb62-8ac3-433e-985c-d5b7eaf96ba1",[1069],[1589],{"id":1590,"sortIndex":32,"affiliation":1591,"properties":28},"cd5f9f35-174d-4e22-8121-26ba8955dad3",{"id":1590,"createTime":28,"updateTime":28,"relativeEntities":1592,"slug":28,"properties":1593,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1596,"statistic":28},[],{"title":1594},{"VI":1595},"Stern School of Business, New York University, New York, USA",[],{"title":1598},{"VI":1599},"Manfred Padberg",{"url":1583,"publisher":1601,"properties":1647},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1602,"slug":872,"properties":1603,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1607,"manageAffiliations":1616,"indexDatabases":1627,"url":28,"thumbnailPath":28,"statistic":1642,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1604,"title":1605,"eissn":1606},{"VOID":875},{"EN":877},{"VOID":879},[1608,1612],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1609,"label":1610,"description":1611,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1613,"label":1614,"description":1615,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1617,1622],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1618,"slug":28,"properties":1619,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1621,"statistic":28},[],{"title":1620},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1623,"slug":28,"properties":1624,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1626,"statistic":28},[],{"title":1625},{"EN":908},[902],[1628,1635],{"id":912,"indexDatabase":1629,"url":924,"indexYears":28,"academicFieldIds":1634,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1630,"label":1631,"description":1632,"key":921,"publicationTags":1633,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1636,"url":936,"indexYears":937,"academicFieldIds":1641,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1637,"label":1638,"description":1639,"key":781,"publicationTags":1640,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1643,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1644,"totalCitation":954,"totalCitationByYear":1645,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1646,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1648,"volume":1650},{"VOID":1649},"139-172",{"VOID":1651},"45","1989-08-01",1989,[923,941],{"id":1656,"createTime":1657,"updateTime":1657,"relativeEntities":1658,"slug":28,"properties":1659,"entityType":1062,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1668,"fullTextUrl":28,"authors":1669,"publicationType":1110,"publisherRelationship":1722,"citationCount":28,"citationInfo":28,"publishDate":1774,"publishYear":1775,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1776,"openAccess":28,"references":28,"isForceReanalyzing":1164},"0111a4ee-fe2c-4b58-ba31-76996a689f98","2023-12-11T22:17:27.943+00:00",[],{"abstract":1660,"title":1662,"references":1664,"doi":1666},{"EN":1661},"This paper presents a faster algorithm for the M-convex submodular flow problem, which is a generalization of the minimum-cost flow problem with an M-convex cost function for the flow-boundary, where an M-convex function is a nonlinear nonseparable discrete convex function on integer points. The algorithm extends the capacity scaling approach for the submodular flow problem by Fleischer, Iwata and McCormick (2002) with the aid of a novel technique of changing the potential by solving maximum submodular flow problems.",{"EN":1663},"A capacity scaling algorithm for M-convex submodular flow",{"VOID":1665},"Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: Solving the convex cost integer dual network flow problem. Manage. Sci. 49, 950–964 (2003)\nCunningham, W.H., Frank, A.: A primal-dual algorithm for submodular flows. Math. Oper. Res. 10, 251–262 (1985)\nDress, A.W.M., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214–250 (1992)\nEdmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)\nEdmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248–264 (1972)\nFleischer, L., Iwata, S., McCormick, S.T.: A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. Ser. A 92, 119–139 (2002)\nFrank, A.: Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory, Ser. B 36, 221–239 (1984)\nFujishige, S.: Algorithms for solving the independent flow-problems. J. Oper. Res. Soc. Japan 21, 189–204 (1978)\nFujishige, S.: Submodular Functions and Optimization. North-Holland, Amsterdam 1991\nFujishige, S., Zhang, X.: New algorithms for the intersection problem of submodular systems. Japan J. Indust. Appl. Math. 9, 369–382 (1992)\nHochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19, 390–409 (1994)\nHochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48, 686–701 (2001)\nHochbaum, D.S., Queyranne, M.: Minimizing a convex cost closure set. SIAM J. Discrete Math. 16, 192–207 (2003)\nIwata, S.: A capacity scaling algorithm for convex cost submodular flows. Math. Program. 76, 299–308 (1997)\nIwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32, 833–840 (2003)\nIwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 761–777 (2001)\nIwata, S., McCormick, S.T., Shigeno, M.: A strongly polynomial cut canceling algorithm for the submodular flow problem. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds), Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 1610, pp. 259–272 Springer-Verlag 1999\nIwata, S., Shigeno, M.: Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization. SIAM J. Optim. 13, 204–211 (2003)\nLovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds), Mathematical Programming –- The State of the Art, pp. 235–257 Springer-Verlag 1983\nMoriguchi, S., Murota, K.: Capacity scaling algorithm for scalable M-convex submodular flow problems. Optim. Methods Softw. 18, 207–218 (2003)\nMurota, K.: Valuated matroid intersection, I: optimality criteria. SIAM J. Discrete Math. 9, 545–561 (1996)\nMurota, K.: Valuated matroid intersection, II: algorithms. SIAM J. Discrete Math. 9, 562–576 (1996)\nMurota, K.: Convexity and Steinitz’s exchange property. Adv. Math. 124, 272–311 (1996)\nMurota, K.: Discrete convex analysis. Math. Program. 83, 313–371 (1998)\nMurota, K.: Submodular flow problem with a nonseparable cost function. Combinatorica 19, 87–109 (1999)\nMurota, K.: Discrete Convex Analysis. SIAM, Philadelphia 2003\nMurota, K., Tamura, A.: Application of M-convex submodular flow problem to mathematical economics. Japan J. Indust. Appl. Math. 20, 257–277 (2003)\nSchrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory, Ser. B 80, 346–355 (2000)\nShioura, A.: Fast scaling algorithms for M-convex function minimization with application to resource allocation problem. Discrete Appl. Math. 134, 303–316 (2003)\nTamura, A.: Coordinatewise domain scaling algorithm for M-convex function minimization. Math. Program., to appear\nTardos, É., Tovey, C.A., Trick, M.A.: Layered augmenting path algorithms. Math. Oper. Res. 11, 362–370 (1986)",{"VOID":1667},"10.1007\u002Fs10107-004-0562-3","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10107-004-0562-3",[1670,1685,1700],{"id":1671,"sortIndex":32,"researcher":28,"roles":1672,"affiliations":1673,"properties":1682,"displayName":1684,"givenName":28,"familyName":28},"4448031a-5e30-4db0-8070-d47fb7cb4b3d",[1069],[1674],{"id":1675,"sortIndex":32,"affiliation":1676,"properties":28},"93ae5ce9-0b64-4048-87a2-591e3963e680",{"id":1675,"createTime":28,"updateTime":28,"relativeEntities":1677,"slug":28,"properties":1678,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1681,"statistic":28},[],{"title":1679},{"VI":1680},"Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan",[],{"title":1683},{"VI":1684},"Satoru Iwata",{"id":1686,"sortIndex":40,"researcher":28,"roles":1687,"affiliations":1688,"properties":1697,"displayName":1699,"givenName":28,"familyName":28},"4df44eb9-9b32-465c-98a4-4e261615ffe2",[1069],[1689],{"id":1690,"sortIndex":32,"affiliation":1691,"properties":28},"c04e7201-130b-49e8-81c6-dc0efb15ec34",{"id":1690,"createTime":28,"updateTime":28,"relativeEntities":1692,"slug":28,"properties":1693,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1696,"statistic":28},[],{"title":1694},{"VI":1695},"CREST, Japan Science and Technology Agency, Saitama, Japan",[],{"title":1698},{"VI":1699},"Satoko Moriguchi",{"id":1701,"sortIndex":123,"researcher":28,"roles":1702,"affiliations":1703,"properties":1719,"displayName":1721,"givenName":28,"familyName":28},"b9311eb1-dd2c-4898-b263-088cb152e216",[1069],[1704,1710],{"id":1675,"sortIndex":32,"affiliation":1705,"properties":28},{"id":1675,"createTime":28,"updateTime":28,"relativeEntities":1706,"slug":28,"properties":1707,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1709,"statistic":28},[],{"title":1708},{"VI":1680},[],{"id":1711,"sortIndex":40,"affiliation":1712,"properties":1718},"b0046eae-c94c-44a2-a27e-0c7346f1c28a",{"id":1711,"createTime":28,"updateTime":28,"relativeEntities":1713,"slug":28,"properties":1714,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1717,"statistic":28},[],{"title":1715},{"EN":1716},"PRESTO, JST",[],{},{"title":1720},{"VI":1721},"Kazuo Murota",{"url":1668,"publisher":1723,"properties":1769},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1724,"slug":872,"properties":1725,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1729,"manageAffiliations":1738,"indexDatabases":1749,"url":28,"thumbnailPath":28,"statistic":1764,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1726,"title":1727,"eissn":1728},{"VOID":875},{"EN":877},{"VOID":879},[1730,1734],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1731,"label":1732,"description":1733,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1735,"label":1736,"description":1737,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1739,1744],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1740,"slug":28,"properties":1741,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1743,"statistic":28},[],{"title":1742},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1745,"slug":28,"properties":1746,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1748,"statistic":28},[],{"title":1747},{"EN":908},[902],[1750,1757],{"id":912,"indexDatabase":1751,"url":924,"indexYears":28,"academicFieldIds":1756,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1752,"label":1753,"description":1754,"key":921,"publicationTags":1755,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1758,"url":936,"indexYears":937,"academicFieldIds":1763,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1759,"label":1760,"description":1761,"key":781,"publicationTags":1762,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1765,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1766,"totalCitation":954,"totalCitationByYear":1767,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1768,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1770,"volume":1772},{"VOID":1771},"181-202",{"VOID":1773},"103","2004-12-29",2004,[923,941],{"id":1778,"createTime":1779,"updateTime":1780,"relativeEntities":1781,"slug":1782,"properties":1783,"entityType":1062,"verifyStatus":880,"verifyTime":1780,"verifyNote":1788,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1789,"fullTextUrl":28,"authors":1790,"publicationType":1110,"publisherRelationship":1791,"citationCount":28,"citationInfo":28,"publishDate":1843,"publishYear":1844,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1845,"openAccess":28,"references":28,"isForceReanalyzing":1164},"013d7ffb-5f30-4f82-9064-1927e514a1f8","2024-01-04T06:52:35.843+00:00","2024-12-27T07:48:33.126+00:00",[],"The-Mathematical-Programming-Society",{"title":1784,"doi":1786},{"EN":1785},"The Mathematical Programming Society",{"VOID":1787},"10.1007\u002FBF01582115","Author title is blank","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01582115",[],{"url":1789,"publisher":1792,"properties":1838},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1793,"slug":872,"properties":1794,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1798,"manageAffiliations":1807,"indexDatabases":1818,"url":28,"thumbnailPath":28,"statistic":1833,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1795,"title":1796,"eissn":1797},{"VOID":875},{"EN":877},{"VOID":879},[1799,1803],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1800,"label":1801,"description":1802,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1804,"label":1805,"description":1806,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1808,1813],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1809,"slug":28,"properties":1810,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1812,"statistic":28},[],{"title":1811},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1814,"slug":28,"properties":1815,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1817,"statistic":28},[],{"title":1816},{"EN":908},[902],[1819,1826],{"id":912,"indexDatabase":1820,"url":924,"indexYears":28,"academicFieldIds":1825,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1821,"label":1822,"description":1823,"key":921,"publicationTags":1824,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1827,"url":936,"indexYears":937,"academicFieldIds":1832,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1828,"label":1829,"description":1830,"key":781,"publicationTags":1831,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1834,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1835,"totalCitation":954,"totalCitationByYear":1836,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1837,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1839,"volume":1841},{"VOID":1840},"263-263",{"VOID":1842},"16","1979-12-01",1979,[923,941],{"id":1847,"createTime":1848,"updateTime":1849,"relativeEntities":1850,"slug":1851,"properties":1852,"entityType":1062,"verifyStatus":26,"verifyTime":1849,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1861,"fullTextUrl":28,"authors":1862,"publicationType":1110,"publisherRelationship":1896,"citationCount":28,"citationInfo":28,"publishDate":1948,"publishYear":1949,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1950,"openAccess":28,"references":28,"isForceReanalyzing":1164},"0149e1ea-06d7-44f7-8f0c-975772f77c59","2024-01-13T20:56:11.198+00:00","2024-12-25T07:24:00.899+00:00",[],"Feasible-directions-algorithms-for-optimization-problems-with-equality-and-inequality-constraints",{"abstract":1853,"title":1855,"references":1857,"doi":1859},{"EN":1854},"In this paper two algorithms, of the feasible-directions and dual feasible-directions type, are presented for optimization problems with equality and inequality constraints. An associated problem, having only inequality constraints, is defined, and shown to be equivalent to the original problem if a certain parameter is sufficiently large. The algorithms solve the associated problem, but incorporate a method for automatically increasing this parameter in order to ensure global convergence to a solution to the original problem. Any feasible directions algorithm can be similarly modified to enable it to handle equality constraints.",{"EN":1856},"Feasible directions algorithms for optimization problems with equality and inequality constraints",{"VOID":1858},"K.J. Arrow and R.M. Solow, “Gradient methods for constrained maxima with weakened assumptions”, in: K.J. Arrow, L. Hurwicz and H. Uzawa, Eds.,Studies in linear and nonlinear programming (Stanford University Press, Stanford, Calif., 1958).\nM.R. Hestenes, “Multiplier and gradient methods”,Journal of Optimization Theory and Application (5) (1969) 303–320.\nM.J.D. Powell, “A method for nonlinear constraints in minimization problems”, in: R. Fletcher, Ed.,Optimization (Academic Press, New York, 1969).\nP.C. Haarhof and J.D. Buys, “A new method for the optimization of a nonlinear function subject to nonlinear constraints”,Computer Journal 13 (1970) 178–184.\nD.P. Bertsekas, “Combined primal-dual and penalty methods for constrained minimization”,SIAM Journal on Control, to appear.\nR. Fletcher, “A class of methods for nonlinear programming with termination and convergence properties”, in: J. Abadie, Ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970).\nR. Fletcher, “A class of methods for nonlinear programming III: rates of convergence”, Tech. Paper TP 445, Theoretical Physics Division, UKAEA Research Group, Atomic Energy Research Establishment, Harwell (May 1971).\nH. Mukai and E. Polak, “A quadratically convergent primal-dual algorithm with global convergence properties”,Mathematical Programming 9 (1975) 336–349.\nM.D. Canon, C.D. Cullum and E. Polak,Theory of optimal control and mathematical programming (McGraw-Hill, New York, 1970).\nF. John, “Extremum problems with inequalities as side conditions”, in: K.O. Friedrichs, O.E. Neugebauer and J.J. Stokes Eds.,Courant anniversary volume (Interscience, New York, 1968).\nG. Zoutendijk,Methods of Feasible Directions (Elsevier, Amsterdam, 1960).\nE. Polak,Computational methods in optimization: a unified approach (Academic Press, New York, 1971).\nO. Pironneau and E. Polak, “A dual method for optimal control problems with initial and final boundary constraints”,SIAM Journal on Control 11 (3) (1973) 536–569.\nE. Polak and D.Q. Mayne, “Algorithms for optimization problems with functional inequality constraints”,IEEE Transactions on Automatic Control AC-21 (1976) 184–193.\nG. McCormick, “An arc method for nonlinear programming”, Tech. Rept. T-295, The George Washington University, School of Engineering and Applied Science, Institute for Management Science and Engineering (February 1974).\nR.T. Rockafellar, “A dual approach to solving nonlinear programming problems by unconstrained optimization”,Mathematical Programming 5 (1973) 354–373.",{"VOID":1860},"10.1007\u002FBF01580371","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01580371",[1863,1878],{"id":1864,"sortIndex":32,"researcher":28,"roles":1865,"affiliations":1866,"properties":1875,"displayName":1877,"givenName":28,"familyName":28},"7d0f9d39-7e95-4bfa-a14b-0ff95289aeeb",[1069],[1867],{"id":1868,"sortIndex":32,"affiliation":1869,"properties":28},"24a2c906-7ed4-4f65-8a20-97148e88c76c",{"id":1868,"createTime":28,"updateTime":28,"relativeEntities":1870,"slug":28,"properties":1871,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1874,"statistic":28},[],{"title":1872},{"VI":1873},"Imperial College of Science and Technology, London, UK",[],{"title":1876},{"VI":1877},"D. Q. Mayne",{"id":1879,"sortIndex":40,"researcher":28,"roles":1880,"affiliations":1881,"properties":1893,"displayName":1895,"givenName":28,"familyName":28},"73d88aaa-897d-4ed9-b14a-cb43a0b12e10",[1069],[1882],{"id":1883,"sortIndex":32,"affiliation":1884,"properties":1890},"15973412-df04-4554-ba06-6f6103977a41",{"id":1883,"createTime":28,"updateTime":28,"relativeEntities":1885,"slug":28,"properties":1886,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1889,"statistic":28},[],{"title":1887},{"VI":1888},"University of California, Berkeley, United States",[],{"title":1891},{"VI":1892},"University of California, Berkeley, USA",{"title":1894},{"VI":1895},"E. Polak",{"url":1861,"publisher":1897,"properties":1943},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1898,"slug":872,"properties":1899,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1903,"manageAffiliations":1912,"indexDatabases":1923,"url":28,"thumbnailPath":28,"statistic":1938,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1900,"title":1901,"eissn":1902},{"VOID":875},{"EN":877},{"VOID":879},[1904,1908],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1905,"label":1906,"description":1907,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1909,"label":1910,"description":1911,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1913,1918],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1914,"slug":28,"properties":1915,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1917,"statistic":28},[],{"title":1916},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1919,"slug":28,"properties":1920,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1922,"statistic":28},[],{"title":1921},{"EN":908},[902],[1924,1931],{"id":912,"indexDatabase":1925,"url":924,"indexYears":28,"academicFieldIds":1930,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":1926,"label":1927,"description":1928,"key":921,"publicationTags":1929,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":1932,"url":936,"indexYears":937,"academicFieldIds":1937,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1933,"label":1934,"description":1935,"key":781,"publicationTags":1936,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":1939,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":1940,"totalCitation":954,"totalCitationByYear":1941,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":1942,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":1944,"volume":1946},{"VOID":1945},"67-80",{"VOID":1947},"11","1976-12-01",1976,[923,941],{"id":1952,"createTime":1953,"updateTime":1954,"relativeEntities":1955,"slug":1956,"properties":1957,"entityType":1062,"verifyStatus":26,"verifyTime":1954,"verifyNote":1063,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1966,"fullTextUrl":28,"authors":1967,"publicationType":1110,"publisherRelationship":2005,"citationCount":28,"citationInfo":28,"publishDate":2057,"publishYear":2058,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":2059,"openAccess":28,"references":28,"isForceReanalyzing":1164},"0149eafc-16c6-4d50-9dea-ee905cd3ecd8","2023-12-11T21:06:27.536+00:00","2025-01-18T22:09:34.273+00:00",[],"Implications-conflicts-and-reductions-for-Steiner-trees",{"abstract":1958,"title":1960,"references":1962,"doi":1964},{"EN":1959},"The Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization. In the past 10 years, there have been significant advances concerning approximation and complexity of the SPG. However, the state of the art in (practical) exact solution of the SPG has remained largely unchallenged for almost 20 years. While the DIMACS Challenge 2014 and the PACE Challenge 2018 brought renewed interest into Steiner tree problems, even the best new SPG solvers cannot match the state of the art on the vast majority of benchmark instances. The following article seeks to advance exact SPG solution once again. The article is based on a combination of three concepts: Implications, conflicts, and reductions. As a result, various new SPG techniques are conceived. Notably, several of the resulting techniques are (provably) stronger than well-known methods from the literature that are used in exact SPG algorithms. Finally, by integrating the new methods into a branch-and-cut framework, we obtain an exact SPG solver that is not only competitive with, but even outperforms the current state of the art on an extensive collection of benchmark sets. Furthermore, we can solve several instances for the first time to optimality.",{"EN":1961},"Implications, conflicts, and reductions for Steiner trees",{"VOID":1963},"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4–20 (2007). https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.disopt.2006.10.006\nAchterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universität Berlin (2007)\nde Aragão, M.P., Werneck, R.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, pp. 1–15. Springer (2002). https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-45643-0_1\nBonnet, É., Sikora, F.: The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: Paul, C., Pilipczuk, M. (eds.) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, pp. 26:1–26:15. Schloss Dagstuhl–Leibniz–Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\u002F\u002Fdoi.org\u002F10.4230\u002FLIPIcs.IPEC.2018.26\nByrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6 (2013). https:\u002F\u002Fdoi.org\u002F10.1145\u002F2432622.2432628\nCheng, X., Du, D.Z.: Steiner Trees in Industry, vol. 11. Springer, Berlin (2004). https:\u002F\u002Fdoi.org\u002F10.1007\u002F0-387-23830-1_4\nDIMACS: 11th DIMACS Challenge. http:\u002F\u002Fdimacs11.zib.de\u002F (2015). Accessed 10 Jan 2020\nDreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195–207 (1971). https:\u002F\u002Fdoi.org\u002F10.1002\u002Fnet.3230010302\nDuin, C.: Steiner Problems in Graphs. Ph.D. thesis, University of Amsterdam (1993)\nDuin, C.: Preprocessing the Steiner Problem in Graphs. Springer US, Boston (2000). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-4757-3171-2_10\nDuin, C., Volgenant, A.: An edge elimination test for the Steiner problem in graphs. Oper. Res. Lett. 8(2), 79–83 (1989). https:\u002F\u002Fdoi.org\u002F10.1016\u002F0167-6377(89)90005-9\nDuin, C.W., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks 19(5), 549–567 (1989). https:\u002F\u002Fdoi.org\u002F10.1002\u002Fnet.3230190506\nFischetti, M., Leitner, M., Ljubić, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203–229 (2017). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12532-016-0111-0\nGamrath, G., Koch, T., Maher, S., Rehfeldt, D., Shinano, Y.: SCIP-Jack—a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2), 231–296 (2017). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12532-016-0114-x\nGoemans, M.X., Olver, N., Rothvoß, T., Zenklusen, R.: Matroids and integrality gaps for hypergraphic Steiner tree relaxations. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC ’12, pp. 1161–1176. Association for Computing Machinery, New York, NY, USA (2012). https:\u002F\u002Fdoi.org\u002F10.1145\u002F2213977.2214081\nHegde, C., Indyk, P., Schmidt, L.: A fast, adaptive variant of the Goemans–Williamson scheme for the prize-collecting Steiner tree problem. In: Workshop of the 11th DIMACS Implementation Challenge. Workshop of the 11th DIMACS Implementation Challenge (2014)\nHougardy, S., Silvanus, J., Vygen, J.: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9(2), 135–202 (2017). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12532-016-0110-1\nHušek, R., Knop, D., Masařík, T.: Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. arXiv preprint arXiv:2002.03583 (2020)\nHwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics. Elsevier Science, Amsterdam (1992)\nIBM: Cplex. https:\u002F\u002Fwww.ibm.com\u002Fanalytics\u002Fcplex-optimizer (2020)\nIwata, Y., Shigemura, T.: Separator-based pruned dynamic programming for Steiner tree. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1520–1527 (2019). https:\u002F\u002Fdoi.org\u002F10.1609\u002Faaai.v33i01.33011520\nJuhl, D., Warme, D.M., Winter, P., Zachariasen, M.: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Math. Program. Comput. 10(4), 487–532 (2018). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12532-018-0135-8\nKarp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-4684-2001-2_9\nKisfaludi-Bak, S., Nederlof, J., Leeuwen, E.J.V.: Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces. ACM Trans. Algorithms (TALG) 16(3), 1–30 (2020). https:\u002F\u002Fdoi.org\u002F10.1145\u002F3371389\nKoch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207–232 (1998). https:\u002F\u002Fdoi.org\u002F10.1002\u002F(SICI)1097-0037(199810)32:3%3C207::AID-NET5%3E3.0.CO;2-O\nKoch, T., Martin, A., Voß, S.: SteinLib: An updated library on Steiner tree problems in graphs. In: Du, D.Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 285–325. Kluwer, Alphen aan den Rijn (2001)\nLeitner, M., Ljubic, I., Luipersbeck, M., Prossegger, M., Resch, M.: New Real-World Instances for the Steiner Tree Problem in Graphs. Tech. rep, ISOR, Uni Wien (2014)\nMüller, B., Serrano, F., Gleixner, A.: Using two-dimensional projections for stronger separation and propagation of bilinear terms. SIAM J. Optim. 30(2), 1339–1365 (2020). https:\u002F\u002Fdoi.org\u002F10.1137\u002F19M1249825\nNederlof, J.: Fast polynomial-space algorithms using Möbius inversion: improving on Steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) International Colloquium on Automata, Languages, and Programming, pp. 713–725. Springer (2009). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-02927-1_59\nPajor, T., Uchoa, E., Werneck, R.F.: A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. (2017). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs12532-017-0123-4\nPolzin, T.: Algorithms for the Steiner Problem in Networks. Ph.D. thesis, Saarland University (2003)\nPolzin, T., Daneshmand, S.V.: A comparison of Steiner tree relaxations. Discrete Appl. Math. 112(1–3), 241–261 (2001). https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0166-218x(00)00318-8\nPolzin, T., Daneshmand, S.V.: Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112(1–3), 263–300 (2001). https:\u002F\u002Fdoi.org\u002F10.1016\u002FS0166-218X(00)00319-X\nPolzin, T., Daneshmand, S.V.: Extending Reduction Techniques for the Steiner Tree Problem, pp. 795–807. Springer, Berlin (2002). https:\u002F\u002Fdoi.org\u002F10.1007\u002F3-540-45749-6_69\nPolzin, T., Daneshmand, S.V.: On Steiner trees and minimum spanning trees in hypergraphs. Oper. Res. Lett. 31(1), 12–20 (2003). https:\u002F\u002Fdoi.org\u002F10.1016\u002FS0167-6377(02)00185-2\nPolzin, T., Daneshmand, S.V.: Practical partitioning-based methods for the Steiner problem. In: Àlvarez, C.., Serna, M.. (eds.) Experimental Algorithms, pp. 247–252. Springer, Berlin (2006). https:\u002F\u002Fdoi.org\u002F10.1007\u002F11764298_22\nPolzin, T., Vahdati-Daneshmand, S.: The Steiner Tree Challenge: An updated Study (2014). Unpublished manuscript at http:\u002F\u002Fdimacs11.cs.princeton.edu\u002Fdownloads.html\nRehfeldt, D., Koch, T.: Implications, conflicts, and reductions for Steiner trees. Tech. Rep. 20-28, ZIB, Takustr. 7, 14195 Berlin (2020)\nRehfeldt, D., Koch, T.: On the exact solution of prize-collecting Steiner tree problems. Tech. Rep. 20-11, ZIB, Takustr. 7, 14195 Berlin (2020)\nReinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991). https:\u002F\u002Fdoi.org\u002F10.1287\u002Fijoc.3.4.376\nRosseti, I., de Aragão, M.P., Ribeiro, C.C., Uchoa, E., Werneck, R.F.: New Benchmark Instances for The Steiner Problem in Graphs. Springer US, Boston (2004). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-1-4757-4137-7_28\nSavelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445–454 (1994). https:\u002F\u002Fdoi.org\u002F10.1287\u002Fijoc.6.4.445\nTakahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Mathematica Japonicae 24, 573–577 (1980)\nUchoa, E.: Reduction tests for the prize-collecting Steiner problem. Oper. Res. Lett. 34(4), 437–444 (2006). https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.orl.2005.02.007\nUchoa, E., Poggi de Aragão, M., Ribeiro, C.C.: Preprocessing Steiner problems from VLSI layout. Networks 40(1), 38–50 (2002). https:\u002F\u002Fdoi.org\u002F10.1002\u002Fnet.10035\nVahdati Daneshmand, S.: Algorithmic Approaches to the Steiner Problem in Networks. Ph.D. thesis, Universität Mannheim (2004)\nVygen, J.: Faster algorithm for optimum Steiner trees. Inf. Process. Lett. 111(21), 1075–1079 (2011). https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.ipl.2011.08.005\nWinter, P.: Reductions for the rectilinear Steiner tree problem. Networks 26(4), 187–198 (1995). https:\u002F\u002Fdoi.org\u002F10.1002\u002Fnet.3230260404\nWitzig, J., Gleixner, A.: Conflict-driven heuristics for mixed integer programming. INFORMS J. Comput. (2020). https:\u002F\u002Fdoi.org\u002F10.1287\u002Fijoc.2020.0973. (Epub ahead of print)\nWong, R.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28, 271–287 (1984). https:\u002F\u002Fdoi.org\u002F10.1007\u002FBF02612335",{"VOID":1965},"10.1007\u002Fs10107-021-01757-5","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10107-021-01757-5",[1968,1983],{"id":1969,"sortIndex":32,"researcher":28,"roles":1970,"affiliations":1971,"properties":1980,"displayName":1982,"givenName":28,"familyName":28},"9a3da65a-72b2-454e-ac26-c3fbfa5087f2",[1069],[1972],{"id":1973,"sortIndex":32,"affiliation":1974,"properties":28},"7e54b705-6277-4581-a82b-8d50c868a298",{"id":1973,"createTime":28,"updateTime":28,"relativeEntities":1975,"slug":28,"properties":1976,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1979,"statistic":28},[],{"title":1977},{"VI":1978},"Applied Algorithmic Intelligence Methods Departement, Zuse Institute Berlin, Berlin, Germany",[],{"title":1981},{"VI":1982},"Daniel Rehfeldt",{"id":1984,"sortIndex":40,"researcher":28,"roles":1985,"affiliations":1986,"properties":2002,"displayName":2004,"givenName":28,"familyName":28},"b3e2ddf6-afda-4d52-95fa-cc396d71fc91",[1069],[1987,1993],{"id":1973,"sortIndex":32,"affiliation":1988,"properties":28},{"id":1973,"createTime":28,"updateTime":28,"relativeEntities":1989,"slug":28,"properties":1990,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1992,"statistic":28},[],{"title":1991},{"VI":1978},[],{"id":1994,"sortIndex":40,"affiliation":1995,"properties":2001},"961f375d-0e0f-481a-89c5-c885575f6ea9",{"id":1994,"createTime":28,"updateTime":28,"relativeEntities":1996,"slug":28,"properties":1997,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2000,"statistic":28},[],{"title":1998},{"VI":1999},"Chair of Software and Algorithms for Discrete Optimization, TU Berlin, Berlin, Germany",[],{},{"title":2003},{"VI":2004},"Thorsten Koch",{"url":1966,"publisher":2006,"properties":2052},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2007,"slug":872,"properties":2008,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2012,"manageAffiliations":2021,"indexDatabases":2032,"url":28,"thumbnailPath":28,"statistic":2047,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":2009,"title":2010,"eissn":2011},{"VOID":875},{"EN":877},{"VOID":879},[2013,2017],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":2014,"label":2015,"description":2016,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":2018,"label":2019,"description":2020,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[2022,2027],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":2023,"slug":28,"properties":2024,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2026,"statistic":28},[],{"title":2025},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":2028,"slug":28,"properties":2029,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2031,"statistic":28},[],{"title":2030},{"EN":908},[902],[2033,2040],{"id":912,"indexDatabase":2034,"url":924,"indexYears":28,"academicFieldIds":2039,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":2035,"label":2036,"description":2037,"key":921,"publicationTags":2038,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":2041,"url":936,"indexYears":937,"academicFieldIds":2046,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2042,"label":2043,"description":2044,"key":781,"publicationTags":2045,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":2048,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":2049,"totalCitation":954,"totalCitationByYear":2050,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":2051,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":2053,"volume":2055},{"VOID":2054},"903-966",{"VOID":2056},"197","2021-12-30",2021,[923,941],{"id":2061,"createTime":2062,"updateTime":2062,"relativeEntities":2063,"slug":28,"properties":2064,"entityType":1062,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":2071,"fullTextUrl":28,"authors":2072,"publicationType":1110,"publisherRelationship":2088,"citationCount":28,"citationInfo":28,"publishDate":2140,"publishYear":2141,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":2142,"openAccess":28,"references":28,"isForceReanalyzing":1164},"015e0c31-e5e0-44a3-bbb6-60ddefa65047","2023-12-22T02:36:58.609+00:00",[],{"title":2065,"doi":2067,"abstract":2069},{"EN":2066},"A branch-and-cut algorithm for capacitated network design problems",{"VOID":2068},"10.1007\u002Fs101070050077",{"EN":2070},"We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traffic demands, the objective is to install more capacity on the edges of the network and route traffic simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet defining inequalities. These inequalities, together with other known combinatorial and mixed-integer rounding inequalities, are used as cutting planes. To choose the branching variable, we use a new rule called “knapsack branching”. We also report on our computational experience using real-life data.","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs101070050077",[2073],{"id":2074,"sortIndex":32,"researcher":28,"roles":2075,"affiliations":2076,"properties":2085,"displayName":2087,"givenName":28,"familyName":28},"53fc46db-1cb8-48b9-8834-089d8bea3bd4",[1069],[2077],{"id":2078,"sortIndex":32,"affiliation":2079,"properties":28},"feb80a6c-4d75-4afe-9747-1e5188276286",{"id":2078,"createTime":28,"updateTime":28,"relativeEntities":2080,"slug":28,"properties":2081,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2084,"statistic":28},[],{"title":2082},{"VI":2083},"School of ORIE, Cornell University, Ithaca, New York, e-mail: oktay@orie.cornell.edu. Current Address: NDPA Department, AT&T Labs. Middletown, NJ 07748, e-mail: oktay@att.com., , US",[],{"title":2086},{"VI":2087},"Oktay Günlük",{"url":2071,"publisher":2089,"properties":2135},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2090,"slug":872,"properties":2091,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2095,"manageAffiliations":2104,"indexDatabases":2115,"url":28,"thumbnailPath":28,"statistic":2130,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":2092,"title":2093,"eissn":2094},{"VOID":875},{"EN":877},{"VOID":879},[2096,2100],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":2097,"label":2098,"description":2099,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":2101,"label":2102,"description":2103,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[2105,2110],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":2106,"slug":28,"properties":2107,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2109,"statistic":28},[],{"title":2108},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":2111,"slug":28,"properties":2112,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2114,"statistic":28},[],{"title":2113},{"EN":908},[902],[2116,2123],{"id":912,"indexDatabase":2117,"url":924,"indexYears":28,"academicFieldIds":2122,"indexDatabaseRanking":28},{"id":914,"createTime":28,"updateTime":28,"relativeEntities":2118,"label":2119,"description":2120,"key":921,"publicationTags":2121,"standard":28},[],{"EN":917,"VI":917},{"EN":919,"VI":920},[923,813],[926,927,928],{"id":930,"indexDatabase":2124,"url":936,"indexYears":937,"academicFieldIds":2129,"indexDatabaseRanking":941},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2125,"label":2126,"description":2127,"key":781,"publicationTags":2128,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940],{"impactFactor":32,"impactFactorByYear":2131,"i10Index":946,"i10IndexLast5Year":127,"totalPublication":947,"totalPublicationByYear":2132,"totalCitation":954,"totalCitationByYear":2133,"totalCitationPerPublication":998,"totalCitationPerPublicationByYear":2134,"hindexLast5Year":565,"hindex":565},{"2012":367,"2013":225,"2014":423,"2015":167,"2016":222,"2017":293,"2018":944,"2019":114,"2020":945,"2021":945,"2022":117,"2023":113},{"1971":136,"1972":149,"1973":281,"1974":137,"1975":152,"1976":201,"1977":689,"1978":207,"1979":160,"1980":689,"1981":138,"1982":50,"1983":162,"1984":281,"1985":279,"1986":206,"1987":200,"1988":567,"1989":689,"1990":329,"1991":325,"1992":599,"1993":333,"1994":599,"1995":157,"1996":353,"1997":50,"1998":160,"1999":688,"2000":149,"2001":138,"2002":353,"2003":949,"2004":434,"2005":158,"2006":600,"2007":829,"2008":139,"2009":434,"2010":829,"2011":436,"2012":600,"2013":566,"2014":333,"2015":950,"2016":566,"2017":826,"2018":611,"2019":951,"2020":687,"2021":952,"2022":953,"2023":354,"2024":147},{"1971":122,"1972":155,"1973":456,"1975":956,"1976":957,"1977":958,"1978":959,"1979":960,"1980":961,"1982":962,"1983":963,"1984":964,"1985":965,"1986":966,"1987":967,"1988":968,"1989":969,"1990":970,"1991":971,"1992":972,"1993":973,"1994":974,"1995":975,"1996":976,"1997":977,"1998":978,"1999":979,"2000":980,"2001":981,"2002":982,"2003":983,"2004":603,"2005":984,"2006":985,"2007":986,"2008":987,"2009":988,"2010":989,"2011":990,"2012":991,"2013":992,"2014":574,"2015":993,"2016":994,"2017":995,"2018":996,"2019":997,"2020":604,"2021":829,"2022":826,"2023":148,"2024":130},{"1971":1000,"1972":235,"1973":1001,"1975":1002,"1976":1003,"1977":1004,"1978":1005,"1979":1006,"1980":1007,"1982":1008,"1983":1009,"1984":1010,"1985":1011,"1986":1012,"1987":1013,"1988":1014,"1989":1015,"1990":1016,"1991":1011,"1992":1017,"1993":1018,"1994":1019,"1995":1020,"1996":1021,"1997":845,"1998":1022,"1999":1023,"2000":1024,"2001":1025,"2002":1026,"2003":1027,"2004":1028,"2005":1029,"2006":1030,"2007":1031,"2008":1032,"2009":1033,"2010":1034,"2011":1035,"2012":1036,"2013":1037,"2014":821,"2015":1038,"2016":1039,"2017":581,"2018":590,"2019":1040,"2020":1041,"2021":1042,"2022":228,"2023":169,"2024":347},{"pages":2136,"volume":2138},{"VOID":2137},"17-39",{"VOID":2139},"86","1999-09-01",1999,[923,941]]