{"id":"https://openalex.org/W6925516143","doi":"https://doi.org/10.17877/de290r-19130","title":"Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem","display_name":"Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W6925516143","doi":"https://doi.org/10.17877/de290r-19130"},"language":"en","primary_location":{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37134","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37134","pdf_url":"http://hdl.handle.net/2003/37134","source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2003/37134","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"B\u00f6kler, Friedrich Konstantin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"B\u00f6kler, Friedrich Konstantin","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":1,"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/T14255","display_name":"European Law and Migration","score":0.05860000103712082,"subfield":{"id":"https://openalex.org/subfields/3308","display_name":"Law"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14255","display_name":"European Law and Migration","score":0.05860000103712082,"subfield":{"id":"https://openalex.org/subfields/3308","display_name":"Law"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13170","display_name":"Discrimination and Equality Law","score":0.04830000177025795,"subfield":{"id":"https://openalex.org/subfields/3308","display_name":"Law"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13035","display_name":"Human Rights and Development","score":0.03290000185370445,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4388999938964844},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.39750000834465027},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.34150001406669617},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.32120001316070557},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2953000068664551},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.2915000021457672},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.28290000557899475}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4749000072479248},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4246000051498413},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2540999948978424},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37134","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37134","pdf_url":"http://hdl.handle.net/2003/37134","source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},{"id":"doi:10.17877/de290r-19130","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-19130","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/37134","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/37134","pdf_url":"http://hdl.handle.net/2003/37134","source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6925516143.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,35,175,315],"this":[1,90,246,326],"thesis,":[2],"we":[3,39,127,179,192,214,249,256,293,320],"are":[4,86,117,180,287,310],"concerned":[5,182],"with":[6,183,222,277,358],"multiobjective":[7,45,74,82,122,132,147,195],"combinatorial":[8,166],"optimization":[9,46,167],"(MOCO)":[10],"problems.":[11,34,69],"We":[12,70,93,154,269,337],"attempt":[13],"to":[14,62,216,258,305,341],"fill":[15],"the":[16,25,73,81,111,121,130,143,146,163,184,194,201,205,208,234,260,266,278,300,306,344],"gap":[17,185],"between":[18,186],"theory":[19,31,187],"and":[20,67,149,188,225,284,349],"practice,":[21],"which":[22,48,162,219,248,303,309],"comes":[23],"from":[24,50,200,233],"lack":[26],"of":[27,56,100,113,159,210,229,244,280,325,335,343],"a":[28,36,41,58,137,157,170,176,226,295,332],"deep":[29],"complexity":[30,42,59,91],"for":[32,44,145,161,172,265],"MOCO":[33],"first":[37,235],"part,":[38,178],"consider":[40],"notion":[43,60],"problems":[47,64,88,160],"derives":[49],"output-sensitive":[51],"complexity.":[52],"The":[53,231],"primary":[54],"goal":[55,247],"such":[57],"is":[61,103,136,141,169,254,354],"classify":[63],"into":[65],"easy":[66,87,105],"hard":[68,114,138],"show":[71,95,128,321],"that":[72,96,129,238,271,285,322,351],"minimum":[75],"cut":[76],"problem":[77,85,106,135,168,199],"as":[78,80],"well":[79,276,311,329],"linear":[83],"programming":[84],"in":[89,207,282,299,313],"theory.":[92],"also":[94,142,155,250],"finding":[97],"extreme":[98],"points":[99],"nondominated":[101],"sets":[102],"an":[104,316],"under":[107],"certain":[108],"assumptions.":[109],"On":[110],"side":[112],"problems,":[115],"there":[116,286],"obvious":[118],"ones":[119],"like":[120],"traveling":[123],"salesperson":[124],"problem.":[125,139,153,268],"Moreover,":[126],"well-known":[131],"shortest":[133,196],"path":[134,197],"This":[140,190,253],"case":[144],"matching":[148],"integer":[150],"min-cost":[151],"flow":[152],"identify":[156],"class":[158],"biobjective":[164],"unconstraint":[165],"barrier":[171],"efficient":[173],"solvability.":[174],"second":[177,301],"again":[181],"practice.":[189,314],"time,":[191],"approach":[193],"(MOSP)":[198],"practical":[202,289],"side.":[203],"For":[204],"application":[206],"planning":[209],"power":[211],"transmission":[212],"lines,":[213],"need":[215],"have":[217],"implementations":[218,290,342],"can":[220],"cope":[221],"large":[223],"graphs":[224],"larger":[227,333],"number":[228,279,334],"objectives.":[230,336,362],"results":[232],"part":[236,302],"suggest":[237],"exact":[239,307],"methods":[240],"might":[241],"be":[242],"incapable":[243],"achieving":[245],"prove":[251],"empirically.":[252],"why":[255],"decide":[257],"study":[259],"literature":[261],"on":[262,331,356],"approximation":[263,297,347],"algorithms":[264,348],"MOSP":[267],"conclude":[270,350],"they":[272],"do":[273],"not":[274],"scale":[275],"objectives":[281],"general":[283],"no":[288],"available.":[291],"Hence,":[292],"develop":[294],"novel":[296],"algorithm":[298,327],"leans":[304],"approaches":[308],"tested":[312],"extensive":[317],"computational":[318],"study,":[319],"our":[323,339,352],"implementation":[324,340,353],"performs":[328],"even":[330],"compare":[338],"other":[345],"existing":[346],"superior":[355],"instances":[357],"more":[359],"than":[360],"three":[361]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}