Have a personal or library account? Click to login
Internet shopping optimization problem Cover

Abstract

A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.

DOI: https://doi.org/10.2478/v10006-010-0028-0 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 385 - 390
Published on: Jul 2, 2010
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2010 JACEK B£A ZÿEWICZ, Mikhail Kovalyov, Jędrzej Musiał, Andrzej Urbanski, Adam Wojciechowski, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 20 (2010): Issue 2 (June 2010)