Published : 2012-02-28

Extended Version of Internet Shopping Optimization Problem

Jędrzej Musiał



Abstract

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 and with different variation of shipping cost. 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.(original abstract)

Keywords:

e-commerce, Algorithms, Optimalization



Details

References

Statistics

Authors

Download files

PDF (Język Polski)

Citation rules

Musiał, J. (2012). Extended Version of Internet Shopping Optimization Problem. Zeszyty Naukowe Wyższej Szkoły Bankowej W Poznaniu, 40(40). Retrieved from https://journals.wsb.poznan.pl/index.php/znwsb/article/view/1321

Altmetric indicators


Cited by / Share



Publisher
Uniwersytet WSB Merito w Poznaniu
ul. Powstańców Wielkopolskich 5
61-895 Poznań
e-mail: journals@poznan.merito.pl
University
Uniwersytet WSB Merito w Poznaniu / WSB Merito University
ul. Powstańców Wielkopolskich 5
61-895 Poznań

About:
Copyright 2022 by Uniwersytet WSB Merito w Poznaniu / WSB Merito University
OJS Support and Customization by LIBCOM
Platform & Workfow by OJS/PKP