WebCompetitive analysis for all investors in the Bahncard problem (a railway pass of the Deutsche Bundesbahn company) has received much attention in recent years. 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 ...
BahnCard: Save on every train ticket with the discount card
Web3 de jul. de 2016 · For the common traveler, the decision at which time to buy a Bahncard is a typical online problem, because she usually does not know when and where she will travel next. We show that the greedy algorithm applied by most travelers and clerks at ticket oces is not better in the worst case than the trivial algorithm which never buys a Bahncard. Webbahncards are not worth it. Travel with myfernbus or flexbus. Bus is much cheaper. Bonus tip: If you insist on taking the train, uncheck, fastest connection, on bahn.de and you will get regional long distance trains, to avoid the expense of taking a IC or ICE. Take longer, still fun. r/germany • 9 days ago. on me beat
(PDF) On the Bahncard problem Rudolf Fleischer - Academia.edu
Web2 de mar. de 2006 · Tagebücher der Wissenschaft. Die Auflösung der Judenfrage. Das Bild des Juden im Spielfilm der DDR: Kapitel III. Dies ist eine unformatierte Version der Magisterarbeit "Die Auflösung der Judenfrage. Das Bild des Juden im Spielfilm der DDR", erforscht und geschrieben von Yoav Sapir an der Hebräischen Universität Jerusalem, … 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 … onmeb student portal