Competitive Algorithms for Online Conversion Problem with Interrelated Prices

The classical uni-directional conversion algorithms are based on the assumption that prices are arbitrarily chosen from the fixed price interval [m,M] where m and M represent the estimated lower and upper bounds of possible prices 0 < m

Bibliographic Details

Published in:	International journal of advanced computer science & applications 2019, Vol.10 (6)
Main Authors:	Iqbal, Javeria, Ahmad, Iftikhar, Shah, Asadullah
Format:	Article
Language:	eng
Subjects:	Algorithms Conversion Lower bounds Preempting Prices Upper bounds
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!