Reference : Internet shopping with price sensitive discounts
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/30196
Internet shopping with price sensitive discounts
English
Blazewicz, Jacek mailto [Institut Polytechnique de Poznan]
Bouvry, Pascal mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Kovalyov, Mikhael mailto [National Academy of Sciences of Belarus]
Musial, Jedrzej mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2014
4OR : Quarterly Journal of the Belgian, French and Italian Operations Research Societies
Springer
12
1
35-48
Yes (verified by ORBilu)
International
1619-4500
1614-2411
Berlin
Germany
[en] Internet shopping ; Computational Complexity ; Optimization
[en] A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational complexity of various special cases is established. Properties of optimal solutions are proved and polynomial time and exponential time solution algorithms based on these properties are designed. Two heuristic algorithms are suggested and computationally tested.
http://hdl.handle.net/10993/30196
10.1007/s10288-013-0230-7
FnR ; FNR6466384 > Pascal Bouvry > IShOP > Internet Shopping Optimization Project > 01/03/2014 > 28/02/2017 > 2013

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
4OR.pdfPublisher postprint170.08 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.