Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/7471
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVeeraraghavan, R.
dc.contributor.authorKashyap, R.
dc.contributor.authorChopde, A.
dc.contributor.authorBhattacharya, S.
dc.date.accessioned2020-03-30T09:59:11Z-
dc.date.available2020-03-30T09:59:11Z-
dc.date.issued2014
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, Vol.8402 LNCS, , pp.271-279en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7471-
dc.description.abstractThe frequent flyer algorithms adopted are static in nature, that is the points awarded to a frequent flyer is proportional only to the miles traveled. In static approach, there is neither an incentive for the frequent flyer to travel more (increase profitability) nor does it ensure customer satisfaction. In this paper, we propose a dynamic approach that considers time varying factors such as competition from rival airliners, number of travels made so far, load factor etc and prove that it can not only improve profitability but at the same time ensure customer satisfaction. � 2014 Springer International Publishing Switzerland.en_US
dc.titleA dynamic approach to frequent flyer programen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.