Competitive algorithms for online conversion problems 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<M. The estimated interval is erroneous and no attempts are...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English English English |
Published: |
The Science and Information (SAI) Organization Limited
2019
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdf http://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf http://irep.iium.edu.my/74100/19/74100_Competitive%20Algorithms%20for%20Online%20Conversion%20_wos.pdf http://irep.iium.edu.my/74100/ https://thesai.org/Downloads/Volume10No6/Paper_75-Competitive_Algorithms_for_Online_Conversion_Problem.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdfhttp://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf
http://irep.iium.edu.my/74100/19/74100_Competitive%20Algorithms%20for%20Online%20Conversion%20_wos.pdf
http://irep.iium.edu.my/74100/
https://thesai.org/Downloads/Volume10No6/Paper_75-Competitive_Algorithms_for_Online_Conversion_Problem.pdf