{"id":"https://openalex.org/W7140103525","doi":"https://doi.org/10.48550/arxiv.2603.19318","title":"Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks","display_name":"Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks","publication_year":2026,"publication_date":"2026-03-16","ids":{"openalex":"https://openalex.org/W7140103525","doi":"https://doi.org/10.48550/arxiv.2603.19318"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.19318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2603.19318","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109698424","display_name":"Minshuo Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Minshuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130390135","display_name":"Yaoxin Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Yaoxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045696168","display_name":"Pavel Troubil","orcid":"https://orcid.org/0000-0002-0739-1177"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Troubil, Pavel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130400935","display_name":"Yingqian Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yingqian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073570057","display_name":"Wim Nuijten","orcid":"https://orcid.org/0000-0003-0351-2768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nuijten, Wim P. M.","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.4449000060558319,"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.4449000060558319,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.18870000541210175,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.05660000070929527,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8481000065803528},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5508999824523926},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5479000210762024},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4936999976634979},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4772000014781952},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.46799999475479126},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42989999055862427},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.421099990606308}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8481000065803528},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5508999824523926},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5479000210762024},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4936999976634979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4781000018119812},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.46799999475479126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4523000121116638},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4043999910354614},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38749998807907104},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3562000095844269},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.33489999175071716},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.266400009393692}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.19318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2603.19318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.19318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Complex":[0],"real-world":[1],"optimization":[2],"problems":[3,16,158],"often":[4],"involve":[5,145],"both":[6,67,127,146],"discrete":[7],"decisions":[8],"and":[9,28,70,85,92,131,149,159],"nonlinear":[10],"relationships":[11],"between":[12,83,90],"variables.":[13],"Many":[14],"such":[15],"can":[17],"be":[18],"modeled":[19],"as":[20],"polynomial-objective":[21,55],"integer":[22,56],"programs,":[23],"encompassing":[24],"cases":[25],"with":[26,138],"quadratic":[27],"higher-degree":[29],"variable":[30],"interactions.":[31],"Nonlinearity":[32],"makes":[33],"them":[34],"more":[35],"challenging":[36],"than":[37],"their":[38],"linear":[39],"counterparts.":[40],"In":[41],"this":[42],"paper,":[43],"we":[44,73],"propose":[45,75],"a":[46,61,76,99,117],"hypergraph":[47,63,77],"neural":[48,78],"network":[49],"(HNN)":[50],"based":[51],"method":[52,124],"to":[53,65,94,109],"solve":[54],"programming":[57],"(POIP).":[58],"Besides":[59],"presenting":[60],"high-degree-term-aware":[62],"representation":[64],"capture":[66],"high-degree":[68,86],"information":[69],"variable-constraint":[71],"interdependencies,":[72],"also":[74],"network,":[79],"which":[80],"integrates":[81],"convolution":[82,89],"variables":[84,91],"terms":[87],"alongside":[88],"constraints,":[93,150],"predict":[95],"solution":[96,136],"values.":[97],"Finally,":[98],"search":[100],"process":[101],"initialized":[102],"from":[103],"the":[104,112,164],"predicted":[105],"solutions":[106],"is":[107],"performed":[108],"further":[110],"refine":[111],"results.":[113],"Comprehensive":[114],"experiments":[115,144],"across":[116],"range":[118],"of":[119],"benchmarks":[120],"demonstrate":[121],"that":[122,142],"our":[123,143,152],"consistently":[125],"outperforms":[126],"existing":[128,165],"learning-based":[129],"approaches":[130],"state-of-the-art":[132],"solvers,":[133],"delivering":[134],"superior":[135],"quality":[137],"favorable":[139],"efficiency.":[140],"Note":[141],"polynomial":[147],"objectives":[148],"demonstrating":[151],"HNN's":[153],"versatility":[154],"for":[155],"general":[156],"POIP":[157],"highlighting":[160],"its":[161],"advancement":[162],"over":[163],"literature.":[166]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-24T00:00:00"}