Bouvry, Pascal[University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Musial, Jedrzej[University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
[en] Internet shopping ; Approximation ; Optimization
[en] In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given set of Internet shops. This problem is an extension of the original Internet shopping optimization problem (ISOP) presented in Blazewich et al. (Int J Appl Math Comput Sci 20(2):385–390, 2010). For each Internet shop, standard prices for the products are given as well as a concave increasing discounting function of the total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Among other results, approximability issues were shortly discussed. This note extends this discussion and corrects a flaw in Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014).
[Institut Polytechnique de Poznan]
