{"id":"https://openalex.org/W6943934129","doi":"https://doi.org/10.17185/duepublico/78228","title":"Novel Machine Learning Algorithms for NP-hard Combinatorial Problems","display_name":"Novel Machine Learning Algorithms for NP-hard Combinatorial Problems","publication_year":2023,"publication_date":"2023-05-17","ids":{"openalex":"https://openalex.org/W6943934129","doi":"https://doi.org/10.17185/duepublico/78228"},"language":"en","primary_location":{"id":"pmh:oai:duepublico2.uni-due.de:duepublico_mods_00078228","is_oa":true,"landing_page_url":"https://duepublico2.uni-due.de/receive/duepublico_mods_00078228","pdf_url":null,"source":{"id":"https://openalex.org/S4306400212","display_name":"DuEPublico (University of Duisburg-Essen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62318514","host_organization_name":"University of Duisburg-Essen","host_organization_lineage":["https://openalex.org/I62318514"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://duepublico2.uni-due.de/receive/duepublico_mods_00078228","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tonnius, Annika","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tonnius, Annika","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":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.16189999878406525,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.16189999878406525,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.10610000044107437,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.08030000329017639,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computational-learning-theory","display_name":"Computational learning theory","score":0.5055000185966492},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4399000108242035},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.40529999136924744},{"id":"https://openalex.org/keywords/online-machine-learning","display_name":"Online machine learning","score":0.39820000529289246},{"id":"https://openalex.org/keywords/instance-based-learning","display_name":"Instance-based learning","score":0.3944999873638153},{"id":"https://openalex.org/keywords/supervised-learning","display_name":"Supervised learning","score":0.38269999623298645},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.3781999945640564},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.36660000681877136}],"concepts":[{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.7002999782562256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.675000011920929},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6305999755859375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5910999774932861},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.5055000185966492},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4399000108242035},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C24138899","wikidata":"https://www.wikidata.org/wiki/Q17141258","display_name":"Instance-based learning","level":3,"score":0.3944999873638153},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.38269999623298645},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3781999945640564},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.36660000681877136},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.34619998931884766},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.34060001373291016},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C58973888","wikidata":"https://www.wikidata.org/wiki/Q1041418","display_name":"Semi-supervised learning","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25380000472068787},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.25200000405311584},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:duepublico2.uni-due.de:duepublico_mods_00078228","is_oa":true,"landing_page_url":"https://duepublico2.uni-due.de/receive/duepublico_mods_00078228","pdf_url":null,"source":{"id":"https://openalex.org/S4306400212","display_name":"DuEPublico (University of Duisburg-Essen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62318514","host_organization_name":"University of Duisburg-Essen","host_organization_lineage":["https://openalex.org/I62318514"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"dissertation"},{"id":"doi:10.17185/duepublico/78228","is_oa":true,"landing_page_url":"https://doi.org/10.17185/duepublico/78228","pdf_url":null,"source":{"id":"https://openalex.org/S4306400212","display_name":"DuEPublico (University of Duisburg-Essen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62318514","host_organization_name":"University of Duisburg-Essen","host_organization_lineage":["https://openalex.org/I62318514"],"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":"thesis"}],"best_oa_location":{"id":"pmh:oai:duepublico2.uni-due.de:duepublico_mods_00078228","is_oa":true,"landing_page_url":"https://duepublico2.uni-due.de/receive/duepublico_mods_00078228","pdf_url":null,"source":{"id":"https://openalex.org/S4306400212","display_name":"DuEPublico (University of Duisburg-Essen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62318514","host_organization_name":"University of Duisburg-Essen","host_organization_lineage":["https://openalex.org/I62318514"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"dissertation"},"sustainable_development_goals":[{"score":0.543010413646698,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0,338],"many":[1],"combinatorial":[2,77,90,156,206],"problems":[3,19,78,91,157],"encountered":[4],"in":[5,39,67,94,137,280,353,418],"practical":[6],"applications,":[7],"there":[8],"are":[9,20,35,92],"currently":[10],"no":[11],"efficient":[12],"solution":[13,114],"algorithms":[14,47],"available.":[15],"In":[16,70],"particular,":[17],"such":[18],"often":[21,36],"NP-hard":[22,76,117],"and":[23,96,148,270,328,346,350,389,422],"thus":[24,149,333],"especially":[25],"difficult":[26,100],"to":[27,75,101,111,129,155,239,258,301,364],"solve":[28],"for":[29,48,132,151,306,391,432],"larger":[30],"instances.":[31],"However,":[32],"exact":[33],"solutions":[34,51,154,169],"not":[37,62],"necessary":[38],"practice.":[40],"While,":[41],"depending":[42],"on":[43,58,179,250],"the":[44,112,165,180,189,196,201,205,212,218,221,224,228,233,251,276,294,308,319,325,329,336,348,358,361,366,374,381,384,392,425,436],"specific":[45],"problem,":[46],"finding":[49],"approximate":[50],"might":[52],"already":[53],"be":[54],"available,":[55],"methods":[56],"based":[57],"machine":[59,82,106,134,159,229,299],"learning":[60,83,107,187,230,300,323],"have":[61],"yet":[63],"found":[64],"widespread":[65],"use":[66],"this":[68,138],"domain.":[69],"general,":[71],"any":[72],"systematic":[73],"approach":[74,143,234,321],"by":[79],"means":[80],"of":[81,116,167,176,204,210,220,227,245,264,293,297,318,322,376,383,397,420,424],"techniques":[84],"faces":[85],"two":[86,265,362],"major":[87],"challenges:":[88],"First,":[89],"discrete":[93,103,168],"nature,":[95],"it":[97,119],"is":[98,125,183,237],"typically":[99],"map":[102],"results":[104,382,414],"with":[105,158,170,185,395],"methods.":[108,261],"Second,":[109],"due":[110],"large":[113,121],"space":[115],"problems,":[118,246],"takes":[120],"computational":[122],"effort,":[123],"or":[124],"even":[126],"practically":[127],"impossible,":[128],"generate":[130],"labels":[131],"supervised":[133],"learning.":[135,160],"Therefore,":[136],"dissertation,":[139],"we":[140,163,247,288,313,341,379,429],"present":[141],"an":[142,271,290],"that":[144,331],"circumvents":[145],"these":[146],"obstacles,":[147],"allows":[150],"efficiently":[152],"predicting":[153],"More":[161],"specifically,":[162],"overcome":[164],"problem":[166,175,207,257,269],"a":[171,240,267,283,303,315,343,398,406],"relaxation":[172],"approach.":[173,310,412,427],"The":[174,192,413],"label":[177],"generation,":[178],"other":[181],"hand,":[182],"avoided":[184],"label-free":[186],"via":[188,324],"loss":[190,193,213,326],"function:":[191],"function":[194,214,327],"represents":[195],"objective":[197,202],"function,":[198],"which":[199],"computes":[200],"value":[203],"itself.":[208],"Instead":[209],"labels,":[211],"thereby":[215],"immediately":[216],"directs":[217],"adaption":[219],"parameters":[222],"during":[223],"gradient-based":[225,298],"training":[226,351],"algorithm.":[231],"Although":[232],"presented":[235],"here":[236],"applicable":[238],"much":[241],"more":[242,407],"general":[243],"class":[244],"will":[248],"focus":[249],"so-called":[252],"hybrid":[253,277,368],"flow":[254,278,369],"shop":[255,279,370],"scheduling":[256],"demonstrate":[259,415],"our":[260,377],"It":[262],"consists":[263],"subproblems:":[266],"permutation":[268],"assignment":[272],"problem.":[273,371],"We":[274],"analyze":[275],"depth,":[281],"including":[282],"formal":[284],"mathematical":[285],"description.":[286],"Additionally,":[287],"give":[289,430],"extensive":[291],"overview":[292],"theoretical":[295,304],"foundations":[296],"provide":[302,314],"foundation":[305],"understanding":[307],"proposed":[309,426],"Most":[311],"importantly,":[312],"detailed":[316],"explanation":[317],"suggested":[320],"literature":[330],"has":[332],"far":[334],"treated":[335],"topic.":[337,437],"each":[339],"subproblem,":[340],"train":[342],"neural":[344,385],"network":[345],"describe":[347],"architecture":[349],"method":[352],"detail,":[354],"as":[355,357,403,405],"well":[356,404],"connection":[359],"between":[360],"networks":[363],"address":[365],"entire":[367],"To":[372],"assess":[373],"effectiveness":[375],"approach,":[378,394],"compare":[380],"networks,":[386],"both":[387],"individually":[388],"combined":[390],"complete":[393],"those":[396],"basic":[399],"Monte":[400],"Carlo":[401],"algorithm,":[402],"advanced":[408],"mixed-integer":[409],"linear":[410],"programming":[411],"noteworthy":[416],"benefits":[417],"terms":[419],"efficiency":[421],"scalability":[423],"Finally,":[428],"suggestions":[431],"further":[433],"research":[434],"concerning":[435]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}