{"id":"https://openalex.org/W6960834232","doi":"https://doi.org/10.14279/depositonce-7327","title":"Uncertainty exploration","display_name":"Uncertainty exploration","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W6960834232","doi":"https://doi.org/10.14279/depositonce-7327"},"language":"en","primary_location":{"id":"pmh:oai:depositonce.tu-berlin.de:11303/8172","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de//handle/11303/8172","pdf_url":"https://depositonce.tu-berlin.de//handle/11303/8172","source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Doctoral Thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://depositonce.tu-berlin.de//handle/11303/8172","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mei\u00dfner, Julie","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mei\u00dfner, Julie","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":true,"cited_by_count":4,"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/T11468","display_name":"Genetic Mapping and Diversity in Plants and Animals","score":0.21469999849796295,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T11468","display_name":"Genetic Mapping and Diversity in Plants and Animals","score":0.21469999849796295,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12045","display_name":"Rice Cultivation and Yield Improvement","score":0.15800000727176666,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T13142","display_name":"GABA and Rice Research","score":0.10899999737739563,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5333999991416931},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49390000104904175},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.48170000314712524},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46369999647140503},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.382999986410141},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.35760000348091125},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.35019999742507935},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.3441999852657318},{"id":"https://openalex.org/keywords/uncertain-data","display_name":"Uncertain data","score":0.3441999852657318}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355999708175659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6187000274658203},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5333999991416931},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46369999647140503},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.382999986410141},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C2778865114","wikidata":"https://www.wikidata.org/wiki/Q7882489","display_name":"Uncertain data","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3407999873161316},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3352999985218048},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27799999713897705},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.2687000036239624},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C27548731","wikidata":"https://www.wikidata.org/wiki/Q88272","display_name":"Investment (military)","level":3,"score":0.2515000104904175},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:depositonce.tu-berlin.de:11303/8172","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de//handle/11303/8172","pdf_url":"https://depositonce.tu-berlin.de//handle/11303/8172","source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Doctoral Thesis"},{"id":"doi:10.14279/depositonce-7327","is_oa":true,"landing_page_url":"https://doi.org/10.14279/depositonce-7327","pdf_url":null,"source":{"id":"https://openalex.org/S7407052985","display_name":"Technische Universit\u00e4t Berlin \u2013 Universit\u00e4tsbibliothek","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:depositonce.tu-berlin.de:11303/8172","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de//handle/11303/8172","pdf_url":"https://depositonce.tu-berlin.de//handle/11303/8172","source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Doctoral Thesis"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.638928234577179,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6960834232.pdf","grobid_xml":"https://content.openalex.org/works/W6960834232.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"optimization":[1,133,177,213],"captures":[2],"a":[3,17,44,57,60,67,80,148,356,390,431,436,444,460,466,507],"wide":[4],"range":[5],"of":[6,14,20,56,66,79,157,176,282,298,370,380,409,451,468,477],"applications":[7],"such":[8],"as":[9,435],"infrastructure":[10,23,33],"design":[11],"and":[12,35,124,174,188,233,251,294,308,350,355,388,399,407,416,426,483,487,496,517],"scheduling":[13,441,465],"tasks.":[15],"For":[16],"fixed":[18],"number":[19,297],"possible":[21],"new":[22,183],"connections":[24],"or":[25,62,85,100],"tasks":[26],"to":[27,113,131,205,247,252,278,367,421],"schedule,":[28],"there":[29,364],"are":[30,138,300,365],"exponentially":[31],"many":[32],"networks":[34],"schedules":[36],"that":[37,142,217,290,311,329,502],"can":[38,103,143,219,314,454],"be":[39,104,144,315,456],"created":[40],"from":[41,303,389],"them.":[42],"Additionally,":[43],"major":[45],"challenge":[46],"is":[47,69,112,152,330,473,506],"data":[48,102,123],"uncertainty.":[49,180,230,287,402],"If,":[50],"for":[51,128,198,210,224,244,274,285,325,347,359,374,413,494,511],"example,":[52],"the":[53,63,77,83,115,125,129,132,163,171,194,202,211,238,245,264,270,280,291,295,304,368,371,405,410,423,427,448,469,475,491,504],"construction":[54],"cost":[55,160,204,320,425],"connection":[58,84],"within":[59],"network":[61],"processing":[64,449],"time":[65,158,450],"job":[68,453],"only":[70],"known":[71],"roughly,":[72],"this":[73,167,283,381],"may":[74],"significantly":[75],"influence":[76],"quality":[78,127,429],"solution":[81,130,209,428],"containing":[82],"job.":[86,470],"Optimization":[87],"with":[88,94,178,317,352,383],"explorable":[89,179,286],"uncertainty":[90,199,277,375,414],"considers":[91],"combinatorial":[92],"problems":[93,313],"uncertain":[95,353],"input":[96],"data,":[97],"where":[98,447],"improved":[99],"exact":[101],"explored":[105],"at":[106],"an":[107,118,153,207,261,459],"additional":[108],"cost.":[109],"The":[110,471],"goal":[111],"quantify":[114],"trade-off":[116],"between":[117],"investment":[119,154],"in":[120,155,237,263,321,430],"more":[121],"precise":[122],"resulting":[126],"problem.":[134,214],"A":[135],"classical":[136,372,411],"application":[137],"estimated":[139],"user":[140,149],"demands":[141],"specified":[145],"by":[146,464],"undertaking":[147],"survey.":[150],"This":[151,231,362],"terms":[156],"and/or":[159],"which":[161,512],"improves":[162],"demand":[164],"estimate.":[165],"In":[166],"thesis":[168],"we":[169,241,419,513],"investigate":[170],"potential,":[172],"limits,":[173],"applicability":[175,281],"We":[181,191,215,267,288,323,341,377,393,439,480,499],"present":[182,242],"algorithmic":[184],"results,":[185],"lower":[186,345,486],"bounds,":[187,307],"computational":[189],"experiments.":[190],"first":[192,271,482],"study":[193],"most":[195],"popular":[196],"model":[197,284,373,382],"exploration:":[200],"Minimize":[201],"exploration":[203,319,415,424],"find":[206],"optimal":[208,515],"underlying":[212],"show":[216,310,343,501],"randomization":[218],"improve":[220],"upon":[221],"deterministic":[222,495,516],"algorithms":[223,243],"minimum":[225],"spanning":[226],"tree":[227],"(MST)":[228],"under":[229,276,401],"solves":[232],"important":[234],"open":[235],"problem":[236,510],"area.":[239],"Furthermore,":[240],"generalizations":[246,257],"non-uniform":[248],"query":[249],"costs":[250],"matroid-like":[253],"set":[254,327],"systems.":[255],"Both":[256],"do":[258],"not":[259,331],"incur":[260],"increase":[262],"competitive":[265,336,492],"ratio.":[266],"also":[268,342,500],"conduct":[269],"practical":[272],"experiments":[273],"MST":[275],"analyze":[279,440],"observe":[289],"average":[292],"performance":[293],"absolute":[296],"queries":[299],"both":[301],"far":[302],"theoretical":[305],"worst-case":[306],"thus":[309],"these":[312],"solved":[316],"small":[318],"practice.":[322],"prove":[324],"any":[326],"system":[328],"matroid-like,":[332],"no":[333],"algorithm":[334],"has":[335],"ratio":[337,493],"less":[338],"than":[339],"three.":[340],"non-constant":[344],"bounds":[346,489],"bipartite":[348],"matching":[349],"knapsack":[351],"profits":[354],"geometric":[357],"proof":[358],"linear":[360],"programs.":[361],"means":[363],"limits":[366,408],"usefulness":[369],"exploration.":[376],"consider":[378,394],"variants":[379],"alternative":[384],"objectives,":[385],"different":[386],"queries,":[387],"parallelization":[391],"viewpoint.":[392],"MST,":[395],"k-th":[396],"smallest":[397],"value,":[398],"sequencing":[400],"Having":[403],"seen":[404],"possibilities":[406],"approach":[412],"its":[417],"variants,":[418],"propose":[420],"combine":[422],"single":[432,445],"objective":[433,472],"function":[434],"novel":[437],"model.":[438],"jobs":[442],"on":[443,490],"machine,":[446],"each":[452],"potentially":[455],"reduced":[457],"(by":[458],"priori":[461],"unknown":[462],"amount)":[463],"test":[467],"minimizing":[474,503],"sum":[476],"completion":[478],"times.":[479],"give":[481,514],"nearly":[484],"tight":[485],"upper":[488],"randomized":[497,518],"algorithms.":[498,520],"makespan":[505],"considerably":[508],"easier":[509],"online":[519]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}