Internet shopping with price-sensitive discounts (vol 12, pg 35, 2014)

被引：4

作者：

Blazewicz, Jacek ^{[1
]}

Bouvry, Pascal ^{[2
]}

Kovalyov, Mikhail Y. ^{[3
]}

Musial, Jedrzej ^{[1
]}

机构：

[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland

[2] Univ Luxembourg, Comp Sci & Commun Res Unit, L-1359 Luxembourg, Luxembourg

[3] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk 220012, BELARUS

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2014年 / 12卷 / 04期

关键词：

Internet shopping; Approximation; Computational complexity; Optimization; Algorithms; OPTIMIZATION;

D O I：

10.1007/s10288-014-0271-6

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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).

引用

页码：403 / 406

页数：4