Title
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
Abstract
One of the very important topics in discrete optimization, motivated by practical applications, is Internet shopping, which is becoming increasingly popular each year. More classical versions of the Internet shopping optimization problem (ISOP) are closely related to the facility location problem and some scheduling problems and have been intensively studied in the literature. In this paper, extensions of the problem are defined and studied. The issue is to buy all the necessary products for a minimum total possible price. This includes all prices of products as well as shipping costs. Studies in this paper include the ISOP with price sensitive discounts and a newly defined optimization problem: the ISOP including two different discounting functions, namely a shipping cost function as well as a price discounting function. First, these are formulated as mathematical programming problems. Then, some algorithms are constructed and extensively tested in a computational experiment.
Year
DOI
Venue
2016
10.1007/s10951-014-0390-0
J. Scheduling
Keywords
Field
DocType
Internet shopping,Algorithms,Optimization,Computational complexity,Applications
Mathematical optimization,Discounting,Discrete optimization,Scheduling (computing),Computer science,Algorithm,Facility location problem,Internet shopping,Optimization problem,Computational complexity theory,The Internet
Journal
Volume
Issue
ISSN
19
3
1094-6136
Citations 
PageRank 
References 
6
0.51
11
Authors
5
Name
Order
Citations
PageRank
Jacek Blazewicz11064154.23
nathanael cheriere260.51
Pierre-françois Dutot316613.95
Jędrzej Musiał4687.17
Denis Trystram51120160.57