{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:38:47Z","timestamp":1767706727336,"version":"3.33.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10878-024-01247-2","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T17:31:24Z","timestamp":1734370284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online multiple one way non-preemptive time series search with interrelated prices"],"prefix":"10.1007","volume":"49","author":[{"given":"Jinghan","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Eube","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haodong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"issue":"2","key":"1247_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/S0097539799358847","volume":"31","author":"G-H Chen","year":"2002","unstructured":"Chen G-H, Kao M-Y, Lyuu Y-D, Wong H-K (2002) Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM J Comput 31(2):447\u2013459","journal-title":"SIAM J Comput"},{"key":"1247_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2015.05.034","volume":"607","author":"FYL Chin","year":"2015","unstructured":"Chin FYL, Bin F, Guo J, Han S, Jueliang H, Jiang M, Lin G, Ting H-F, Zhang L, Zhang Y et al (2015) Competitive algorithms for unbounded one-way trading. Theoret Comput Sci 607:35\u201348","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"1247_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00453-007-9156-9","volume":"55","author":"P Damaschke","year":"2009","unstructured":"Damaschke P, Ha PH, Tsigas P (2009) Online search with time-varying price bounds. Algorithmica 55(4):619\u2013642","journal-title":"Algorithmica"},{"key":"1247_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv R, Fiat A, Karp RM, Turpin G (2001) Optimal search and one-way trading online algorithms. Algorithmica 30:101\u2013139","journal-title":"Algorithmica"},{"issue":"1","key":"1247_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10878-009-9239-4","volume":"21","author":"H Fujiwara","year":"2011","unstructured":"Fujiwara H, Iwama K, Sekiguchi Y (2011) Average-case competitive analyses for one-way trading. J Comb Optim 21(1):83\u2013107","journal-title":"J Comb Optim"},{"key":"1247_CR6","doi-asserted-by":"publisher","first-page":"4238","DOI":"10.1007\/s00453-018-00534-9","volume":"81","author":"SPY Fung","year":"2019","unstructured":"Fung SPY (2019) Optimal online two-way trading with bounded number of transactions. Algorithmica 81:4238\u20134257","journal-title":"Algorithmica"},{"issue":"2","key":"1247_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00453-008-9217-8","volume":"55","author":"J Lorenz","year":"2009","unstructured":"Lorenz J, Panagiotou K, Steger A (2009) Optimal algorithms for k-search with application in option pricing. Algorithmica 55(2):311\u2013328","journal-title":"Algorithmica"},{"key":"1247_CR8","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s10878-017-0131-3","volume":"34","author":"G Schmidt","year":"2017","unstructured":"Schmidt G (2017) Competitive analysis of bi-directional non-preemptive conversion. J Comb Optim 34:1096\u20131113","journal-title":"J Comb Optim"},{"key":"1247_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.cie.2018.03.034","volume":"119","author":"P Schroeder","year":"2018","unstructured":"Schroeder P, Dochow R, Schmidt G (2018) Optimal solutions for the online time series search and one-way trading problem with interrelated prices and a profit function. Comput Ind Eng 119:465\u2013471","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1247_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s12351-020-00548-8","volume":"22","author":"P Schroeder","year":"2022","unstructured":"Schroeder P, Kacem I (2022) Optimal solutions for online conversion problems with interrelated prices. Oper Res Int J 22(1):423\u2013448","journal-title":"Oper Res Int J"},{"issue":"2","key":"1247_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1051\/ro\/2018064","volume":"53","author":"P Schroeder","year":"2019","unstructured":"Schroeder P, Kacem I, Schmidt G (2019) Optimal online algorithms for the portfolio selection problem, bi-directional trading and-search with interrelated prices. RAIRO-Oper Res 53(2):559\u2013576","journal-title":"RAIRO-Oper Res"},{"issue":"2","key":"1247_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"issue":"3","key":"1247_CR13","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.ejor.2016.01.031","volume":"252","author":"W Wang","year":"2016","unstructured":"Wang W, Wang L, Lan Y, Zhang J (2016) Competitive difference analysis of the one-way trading problem with limited information. Eur J Oper Res 252(3):879\u2013887","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1247_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.tcs.2009.09.026","volume":"412","author":"X Yinfeng","year":"2011","unstructured":"Yinfeng X, Zhang W, Zheng F (2011) Optimal algorithms for the online time series search problem. Theoret Comput Sci 412(3):192\u2013197","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"1247_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10878-010-9344-4","volume":"23","author":"W Zhang","year":"2012","unstructured":"Zhang W, Yinfeng X, Zheng F, Dong Y (2012) Optimal algorithms for online time series search and one-way trading with interrelated prices. J Comb Optim 23(2):159\u2013166","journal-title":"J Comb Optim"},{"issue":"14","key":"1247_CR16","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.ipl.2011.04.008","volume":"111","author":"W Zhang","year":"2011","unstructured":"Zhang W, Yinfeng X, Zheng F, Liu M (2011) Online algorithms for the general k-search problem. Inf Process Lett 111(14):678\u2013682","journal-title":"Inf Process Lett"},{"issue":"1","key":"1247_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/s10878-021-00841-y","volume":"44","author":"W Zhang","year":"2022","unstructured":"Zhang W, Zhang Y, Cheng Y, Zheng S (2022) An online trading problem with an increasing number of available products. J Comb Optim 44(1):518\u2013531","journal-title":"J Comb Optim"},{"issue":"4","key":"1247_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.3934\/mfc.2018019","volume":"1","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Chin FYL, Lau FCM, Tan H, Ting H-F (2018) Constant competitive algorithms for unbounded one-way trading under monotone hazard rate. Math Found Comput 1(4):383\u2013392","journal-title":"Math Found Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01247-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01247-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01247-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T19:04:10Z","timestamp":1737745450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01247-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1247"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01247-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,12,16]]},"assertion":[{"value":"4 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors received no research support\/consulting fees from any organization. No potential Conflict of interest relevant to this article exist.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}