- Tytuł:
- Internet shopping optimization problem
- Autorzy:
-
Błażewicz, J.
Kovalyov, M. Y.
Musiał, J.
Urbański, A. P.
Wojciechowski, A. - Powiązania:
- https://bibliotekanauki.pl/articles/907755.pdf
- Data publikacji:
- 2010
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
algorytm
złożoność obliczeniowa
algorytm kombinatoryczny
optymalizacja
zakupy internetowe
algorithm
computational complexity
combinatorial algorithms
optimization
Internet shopping - Opis:
- 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.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł