{"id":"https://openalex.org/W3007365009","doi":"https://doi.org/10.3390/a13020042","title":"Lower and Upper Bounds for the Discrete Bi-Directional Preemptive Conversion Problem with a Constant Price Interval","display_name":"Lower and Upper Bounds for the Discrete Bi-Directional Preemptive Conversion Problem with a Constant Price Interval","publication_year":2020,"publication_date":"2020-02-18","ids":{"openalex":"https://openalex.org/W3007365009","doi":"https://doi.org/10.3390/a13020042","mag":"3007365009"},"language":"en","primary_location":{"id":"doi:10.3390/a13020042","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020042","pdf_url":"https://www.mdpi.com/1999-4893/13/2/42/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/2/42/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033241617","display_name":"Michael Schwarz","orcid":"https://orcid.org/0000-0002-9828-0308"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Schwarz","raw_affiliation_strings":["Department of Operations Research and Business Informatics, Saarland University, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research and Business Informatics, Saarland University, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033241617"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1542,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48479304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"42","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.7647377252578735},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7636784911155701},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.720739483833313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6546722650527954},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5032405257225037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43802350759506226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22986003756523132},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22637048363685608},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09838134050369263}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.7647377252578735},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7636784911155701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.720739483833313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6546722650527954},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5032405257225037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43802350759506226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22986003756523132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22637048363685608},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09838134050369263},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13020042","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020042","pdf_url":"https://www.mdpi.com/1999-4893/13/2/42/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ac51cf1bfbb14b59a3c473779b02a53f","is_oa":true,"landing_page_url":"https://doaj.org/article/ac51cf1bfbb14b59a3c473779b02a53f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 2, p 42 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/2/42/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13020042","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13020042","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13020042","pdf_url":"https://www.mdpi.com/1999-4893/13/2/42/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.46000000834465027,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3007365009.pdf","grobid_xml":"https://content.openalex.org/works/W3007365009.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1494101111","https://openalex.org/W1552828154","https://openalex.org/W1986329165","https://openalex.org/W2001747258","https://openalex.org/W2024153410","https://openalex.org/W2041645394","https://openalex.org/W2052284057","https://openalex.org/W2089591294","https://openalex.org/W2093226551","https://openalex.org/W2118877434","https://openalex.org/W2159472851","https://openalex.org/W2160509725","https://openalex.org/W2500644353","https://openalex.org/W2607270909","https://openalex.org/W2891067890","https://openalex.org/W2964970246","https://openalex.org/W2972104782","https://openalex.org/W3022382042","https://openalex.org/W3137953896","https://openalex.org/W6672841017","https://openalex.org/W6766032920","https://openalex.org/W6792259665"],"related_works":["https://openalex.org/W1488585910","https://openalex.org/W2563401265","https://openalex.org/W2012502482","https://openalex.org/W1969305723","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536","https://openalex.org/W4319874546"],"abstract_inverted_index":{"In":[0,79],"the":[1,13,17,20,23,37,41,46,74,82,98,123,138],"conversion":[2,29,47,101],"problem,":[3,39,48],"wealth":[4,18],"has":[5,50],"to":[6,15],"be":[7,130],"distributed":[8],"between":[9],"two":[10],"assets":[11],"with":[12,31,103],"objective":[14],"maximize":[16],"at":[19,120],"end":[21],"of":[22,40,45,63,84,88],"investment":[24],"horizon.":[25],"The":[26],"bi-directional":[27,99],"preemptive":[28,100],"problem":[30,102],"a":[32,60,85,104],"constant":[33,105],"price":[34,65,106],"interval":[35,107],"is":[36,90,117,135],"only":[38],"four":[42],"main":[43],"variants":[44],"that":[49,132],"not":[51],"yet":[52],"been":[53],"optimally":[54],"solved":[55],"by":[56],"competitive":[57,75],"analysis.":[58],"Assuming":[59],"given":[61,86,118,124],"number":[62,87],"monotonous":[64],"trends":[66],"called":[67],"runs,":[68],"lower":[69,93],"and":[70,92,94],"upper":[71,95,125],"bounds":[72,96],"for":[73,97,137],"ratio":[76],"are":[77,108],"given.":[78,109],"this":[80,133],"work,":[81],"assumption":[83],"runs":[89],"rejected":[91],"Furthermore,":[110],"an":[111],"algorithm":[112,134],"based":[113],"on":[114],"error":[115],"balancing":[116],"which":[119],"minimum":[121],"achieves":[122],"bound.":[126],"It":[127],"can":[128],"also":[129],"shown":[131],"optimal":[136],"single-period":[139],"model.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}