{"id":"https://openalex.org/W7163166333","doi":"https://doi.org/10.48550/arxiv.2606.01425","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","display_name":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","publication_year":2026,"publication_date":"2026-05-31","ids":{"openalex":"https://openalex.org/W7163166333","doi":"https://doi.org/10.48550/arxiv.2606.01425"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.01425","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01425","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.01425","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137678895","display_name":"Gishnu Madhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhu, Gishnu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137622357","display_name":"Feng Liu","orcid":"https://orcid.org/0000-0002-2310-3921"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Feng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137636615","display_name":"Souma Chowdhury","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chowdhury, Souma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.3427000045776367,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.3427000045776367,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.3095000088214874,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.07909999787807465,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.44110000133514404},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4334999918937683},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.39910000562667847},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.3921000063419342},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3716000020503998},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.36480000615119934},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.358599990606308},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.3481999933719635}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5658000111579895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5401999950408936},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.44110000133514404},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4334999918937683},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3718999922275543},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3481999933719635},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.326200008392334},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31529998779296875},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2727000117301941},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.26649999618530273},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.2639000117778778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2605000138282776},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.01425","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01425","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.01425","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01425","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6338751316070557,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Mixed-combinatorial":[0],"nonlinear":[1,213],"programming":[2],"(MCNLP)":[3],"problems":[4,214],"arise":[5],"in":[6,59,132,190],"many":[7],"engineering":[8],"design":[9,20,158],"and":[10,18,27,47,62,150,179,206,220,238],"planning":[11,61],"applications,":[12],"e.g.,":[13],"due":[14],"to":[15,68,105,165,185,223],"categorical,":[16],"component,":[17],"geometric":[19],"choices,":[21],"as":[22,24,36],"well":[23],"joint":[25],"task":[26],"motion":[28],"planning.":[29],"Traditional":[30],"representations":[31],"of":[32,89,103,123,127,182,218],"combinatorial":[33,73,91,130],"spaces,":[34],"such":[35],"integer":[37],"or":[38],"binary":[39],"encoding,":[40],"often":[41],"introduce":[42],"spurious":[43],"relations,":[44],"increase":[45],"dimensionality,":[46],"require":[48],"additional":[49],"compatibility":[50],"constraints.":[51],"Instead,":[52],"this":[53,82,124],"paper":[54,83],"draws":[55],"on":[56,210],"recent":[57,138],"developments":[58],"robot":[60],"vehicle/network":[63],"routing":[64],"domains":[65],"that":[66,141,191],"aim":[67],"learn":[69],"search":[70],"heuristics":[71],"over":[72,144],"spaces":[74],"using":[75,112,160,226],"graph":[76,102,108],"neural":[77],"networks":[78],"(GNNs).":[79],"More":[80],"specifically,":[81],"presents":[84],"a":[85,95,106,137,166,175,201],"first-of-its-kind":[86],"structured":[87],"abstraction":[88,162,172],"the":[90,121,129,145,152,161,186,195,229],"space":[92,131],"by":[93,159],"learning":[94],"mapping":[96],"from":[97],"an":[98,113],"undirected":[99],"fully":[100],"connected":[101],"combinations":[104,183,219],"directed":[107],"indicating":[109],"improvement":[110],"directions":[111],"Edge":[114],"Field":[115],"Graph":[116],"Network":[117],"(EFGN).":[118],"To":[119],"demonstrate":[120],"utility":[122],"new":[125],"way":[126],"abstracting":[128],"solving":[133],"MCNLPs,":[134],"we":[135],"adopt":[136],"optimization":[139,205],"framework":[140],"purely":[142],"searches":[143],"non-combinatorial":[146],"(e.g.,":[147],"continuous)":[148],"variables":[149],"retrieves":[151],"best-suited":[153],"combination":[154],"for":[155],"each":[156],"candidate":[157],"model,":[163],"akin":[164],"recommender":[167,231],"system.":[168],"The":[169],"presented":[170],"direction-aware":[171],"model":[173],"provides":[174],"potentially":[176],"more":[177],"scalable":[178],"interpretable":[180],"retrieval":[181],"compared":[184],"original":[187],"recommendation":[188],"system":[189],"framework.":[192],"For":[193],"evaluation,":[194],"proposed":[196],"method":[197],"is":[198],"integrated":[199],"with":[200,215],"well-known":[202],"particle":[203],"swarm":[204],"genetic":[207],"algorithm":[208],"solvers":[209,225],"three":[211],"benchmark":[212],"varying":[216],"numbers":[217],"variables.":[221],"Compared":[222],"baseline":[224],"indexified":[227],"combinations,":[228],"GNN-based":[230],"consistently":[232],"achieves":[233],"better":[234],"mean":[235],"optimum":[236],"values":[237],"robustness":[239],"across":[240],"multiple":[241],"runs.":[242]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-03T00:00:00"}