Web19 de fev. de 2024 · The problem consists of deciding on which dates BahnCards should be purchased such that the overall cost, that is, BahnCard prices plus (reduced) ticket prices, is minimized without having knowledge about the number and prices of future journeys. In this paper, we extend the problem such that multiple kinds of BahnCards … WebThis paper investigated a new framework for the competitive analysis of the Bahncard problem. In contrast to the earlier approach we introduce the interest rate i and the risk …
Average-Case Analysis for Special Cases of Online Bahncard Problem
Web11 de out. de 2024 · The BahnCard problem is an important problem in the realm of online decision making. In its original form, there is one kind of BahnCard associated with a … WebBahncard Problem Rudolf Fleisc her? Max-Planc k-Institut f ur Informatik, Im Stadt w ald, 66123 Saarbr uc k en, German y. E-mail: [email protected]. Abstract. In this pap er, w e generalize the Ski-R ental Pr oblem to Bahnc ar d Pr oblem whic h is an online problem of practical relev ance for all tra v elers. The Bahncard is a railw y pass ... neilan and sons
(PDF) On the Bahncard problem Rudolf Fleischer - Academia.edu
WebThe Bahncard Problem with Interest Rate and Risk 309 δ j(t j,p j) The travel request where t j is the travel time and p j is the regular ticket price. α =1/(1+i). The present discount … Web2:6 OntheMulti-KindBahnCardProblem Table2CharacteristicsofGermanBahnCards. C T β BC25 62 365 0.75 BC50 255 365 0.50 BC100 4395 365 0.00 4.1 Always-Top-Algorithm The ... it jobs with full training provided