{"id":"https://openalex.org/W4387846327","doi":"https://doi.org/10.1145/3583780.3615156","title":"VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs","display_name":"VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs","publication_year":2023,"publication_date":"2023-10-21","ids":{"openalex":"https://openalex.org/W4387846327","doi":"https://doi.org/10.1145/3583780.3615156"},"language":"en","primary_location":{"id":"doi:10.1145/3583780.3615156","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583780.3615156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080871672","display_name":"Mina Samizadeh","orcid":"https://orcid.org/0000-0002-1082-966X"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mina Samizadeh","raw_affiliation_strings":["University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011783006","display_name":"Guangmo Tong","orcid":"https://orcid.org/0000-0003-3247-4019"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guangmo Tong","raw_affiliation_strings":["University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080871672"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23691084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4269","last_page":"4273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7107555866241455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6563595533370972},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6470462679862976},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6120386123657227},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6014687418937683},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5702605247497559},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5343685746192932},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48441416025161743},{"id":"https://openalex.org/keywords/salient","display_name":"Salient","score":0.4485067129135132},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4254691004753113},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4091278910636902},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3610665798187256},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3000364899635315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2712929844856262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20652297139167786}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7107555866241455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6563595533370972},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6470462679862976},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6120386123657227},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6014687418937683},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5702605247497559},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5343685746192932},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48441416025161743},{"id":"https://openalex.org/C2780719617","wikidata":"https://www.wikidata.org/wiki/Q1030752","display_name":"Salient","level":2,"score":0.4485067129135132},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4254691004753113},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4091278910636902},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3610665798187256},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3000364899635315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2712929844856262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20652297139167786},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583780.3615156","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583780.3615156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G851293817","display_name":null,"funder_award_id":"2144285","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8650743824","display_name":null,"funder_award_id":"IIS-2144285","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1963822838","https://openalex.org/W1987374783","https://openalex.org/W2039870579","https://openalex.org/W2078431586","https://openalex.org/W2194775991","https://openalex.org/W2475287302","https://openalex.org/W2964350391","https://openalex.org/W2998757566","https://openalex.org/W3027146252","https://openalex.org/W3047863327","https://openalex.org/W3121523901","https://openalex.org/W3211394146","https://openalex.org/W4210896998","https://openalex.org/W4281289227","https://openalex.org/W4307933731"],"related_works":["https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2946024655","https://openalex.org/W2861856156","https://openalex.org/W2146364482","https://openalex.org/W2758988501","https://openalex.org/W4236147943"],"abstract_inverted_index":{"Data-driven":[0],"approaches":[1],"have":[2],"been":[3],"proven":[4],"effective":[5],"in":[6,65],"solving":[7],"combinatorial":[8,60],"optimization":[9,51,88,128],"problems":[10,18,52,89],"over":[11,53],"graphs":[12],"such":[13,27,105],"as":[14],"the":[15,20,31,46,55,63,66,94,102,116],"traveling":[16],"salesman":[17],"and":[19],"vehicle":[21],"routing":[22],"problem.":[23],"The":[24],"rationale":[25],"behind":[26],"methods":[28,107],"is":[29,80,108],"that":[30,40,79,101],"input":[32],"instances":[33],"may":[34],"follow":[35],"distributions":[36],"with":[37],"salient":[38],"patterns":[39],"can":[41,83],"be":[42],"leveraged":[43],"to":[44,115],"overcome":[45],"worst-case":[47],"computational":[48],"hardness.":[49],"For":[50],"graphs,":[54],"common":[56],"practice":[57],"of":[58,68,104],"neural":[59,84],"solvers":[61],"consumes":[62],"inputs":[64],"form":[67],"adjacency":[69],"matrices.":[70],"In":[71],"this":[72],"paper,":[73],"we":[74],"explore":[75],"a":[76,91,122],"vision-based":[77,106],"method":[78],"conceptually":[81],"novel:":[82],"models":[85],"solve":[86],"graph":[87,95],"bytaking":[90],"look":[92],"at":[93],"pattern":[96],"-":[97],"Our":[98],"results":[99],"suggest":[100],"performance":[103],"not":[109],"only":[110],"non-trivial":[111],"but":[112],"also":[113],"comparable":[114],"state-of-the-art":[117],"matrix-based":[118],"methods,":[119],"which":[120],"opens":[121],"new":[123],"avenue":[124],"for":[125],"developing":[126],"data-driven":[127],"solvers.":[129]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}