Citation
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms. Journal of Scheduling, 19 (3): 245-255, 2016.
Selected
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.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-014-0390-0 You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2016-245-255-SI, author = {Blazewicz, Jacek and Cheriere, Nathanael and Dutot, Pierre-Francois and Musial, Jedrzej and Trystram, Denis},
title = {{Novel dual discounting functions for the Internet shopping optimization problem: new algorithms}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {245--255},
number = {3},
note = {Selected},
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.}},
doi = {{10.1007/s10951-014-0390-0}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
owner = {Graham},
researcherid-numbers = {{Musial, Jedrzej/G-1252-2014}},
timestamp = {2017.01.18},
unique-id = {{ISI:000377606100004}} }