{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T05:51:33Z","timestamp":1778737893583,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:00:00Z","timestamp":1643068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100017596","name":"natural science basic research program of shaanxi province","doi-asserted-by":"crossref","award":["2021 JM-317"],"award-info":[{"award-number":["2021 JM-317"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11771346"],"award-info":[{"award-number":["11771346"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00841-y","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T00:02:51Z","timestamp":1643068971000},"page":"518-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An online trading problem with an increasing number of available products"],"prefix":"10.1007","volume":"44","author":[{"given":"Wenming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ye","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0405-5263","authenticated-orcid":false,"given":"Yongxi","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Shankui","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,25]]},"reference":[{"issue":"2","key":"841_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/S0097539799358847","volume":"31","author":"GH Chen","year":"2001","unstructured":"Chen GH, Kao MY, Lyuu YD, Wong HK (2001) 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":"841_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, Fu B, Guo J et al (2015) Competitive algorithms for unbounded one-way trading. Theor Comput Sci 607:35\u201348","journal-title":"Theor Comput Sci"},{"key":"841_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2017","unstructured":"Copil K, Worbelauer M, Meyr H, Tempelmeier H (2017) Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectr 39:1\u201364","journal-title":"OR Spectr"},{"key":"841_CR4","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:619\u2013642","journal-title":"Algorithmica"},{"issue":"2","key":"841_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl A, Kimms A (1997) Lot sizing and scheduling\u2014survey and extensions. Eur J Oper Res 99(2):221\u2013235","journal-title":"Eur J Oper Res"},{"issue":"1","key":"841_CR6","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(1):101\u2013139","journal-title":"Algorithmica"},{"key":"841_CR7","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:83\u2013107","journal-title":"J Comb Optim"},{"key":"841_CR8","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"},{"key":"841_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2017.01.008","volume":"718","author":"S Hasegawa","year":"2018","unstructured":"Hasegawa S, Itoh T (2018) Optimal online algorithms for the multi-objective time series search problem. Theor Comput Sci 718:58\u201366","journal-title":"Theor Comput Sci"},{"key":"841_CR10","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:311\u2013328","journal-title":"Algorithmica"},{"key":"841_CR11","doi-asserted-by":"crossref","unstructured":"Manasse M, McGeoch LA, Sleator D (1988) Competitive algorithms for on-line problems. In: Proceedings of 20th annual ACM symposium on theory of computing. ACM, New York, pp 322\u2013333","DOI":"10.1145\/62212.62243"},{"issue":"2","key":"841_CR12","first-page":"87","volume":"19","author":"E Mohr","year":"2014","unstructured":"Mohr E, Ahmad I, Schmidt G (2014) Online algorithms for conversion problems: a survey. Surv Oper Res Manag Sci 19(2):87\u2013104","journal-title":"Surv Oper Res Manag Sci"},{"issue":"253","key":"841_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"LJ Savage","year":"1951","unstructured":"Savage LJ (1951) The theory of statistical decision. J Am Stat Assoc 46(253):55\u201367","journal-title":"J Am Stat Assoc"},{"issue":"4","key":"841_CR14","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 Combin Optim 34(4):1096\u20131113","journal-title":"J Combin Optim"},{"key":"841_CR15","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"},{"key":"841_CR16","doi-asserted-by":"crossref","unstructured":"Schroeder P, Kacem I (2020) Optimal solutions for online conversion problems with interrelated prices. Int J Oper Res 1\u201326","DOI":"10.1007\/s12351-020-00548-8"},{"key":"841_CR17","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:559\u2013576","journal-title":"RAIRO Oper Res"},{"key":"841_CR18","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:202\u2013208","journal-title":"Commun ACM"},{"key":"841_CR19","doi-asserted-by":"crossref","unstructured":"Tiedemann M, Ide J, Sch\u00f6bel A (2015) Competitive analysis for multi-objective online algorithms. In: Rahman MS, Tomita E (eds) WALCOM: algorithms and computation. WALCOM 2015. Lecture notes in computer science, vol 8973. Springer, Cham, pp 210\u2013221","DOI":"10.1007\/978-3-319-15612-5_19"},{"issue":"3","key":"841_CR20","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 JX (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":"841_CR21","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.tcs.2009.09.026","volume":"412","author":"Y Xu","year":"2011","unstructured":"Xu Y, Zhang W, Zheng F (2011) Optimal algorithms for the online time series search problem. Theor Comput Sci 412(3):192\u2013197","journal-title":"Theor Comput Sci"},{"issue":"4","key":"841_CR22","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 et al (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"},{"issue":"2","key":"841_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10878-010-9344-4","volume":"23","author":"W Zhang","year":"2012","unstructured":"Zhang W, Xu Y, 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":"5","key":"841_CR24","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.cor.2011.07.011","volume":"39","author":"W Zhang","year":"2012","unstructured":"Zhang W, Xu Y, Zheng F, Dong Y (2012) Online algorithms for the multiple time series search problem. Comput Oper Res 39(5):929\u2013938","journal-title":"Comput Oper Res"},{"issue":"14","key":"841_CR25","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, Xu Y, 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"},{"key":"841_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2015.06.005","volume":"593","author":"W Zhang","year":"2015","unstructured":"Zhang W, Zhang E, Zheng F (2015) Online (J, K)-search problem and its competitive analysis. Theor Comput Sci 593:139\u2013145","journal-title":"Theor Comput Sci"},{"issue":"6","key":"841_CR27","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1142\/S0129054116500210","volume":"27","author":"W Zhang","year":"2016","unstructured":"Zhang W, Zhang E, Zheng F (2016) Online two stage $$k$$-search problem and its competitive analysis. Int J Found Comput Sci 27(6):653\u2013663","journal-title":"Int J Found Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00841-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00841-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00841-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:49Z","timestamp":1659079729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00841-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,25]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["841"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00841-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,25]]},"assertion":[{"value":"11 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","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 have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Data sharing not applicable to this article as no datasets were generated or analysed during the current study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and materials"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}