Internet shopping optimization problem

Authors:
Jacek Błazewicz;Mikhail Kovalyov;Jędrzej Musiał;Andrezej Urbański;Adam Wojciechowski
Affiliations:
-;United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus;Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, Poland;Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, Poland;Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, Poland
Venue:
International Journal of Applied Mathematics and Computer Science
Year:
2010

Citing 7
Cited 1

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Practical digital libraries: books, bytes, and bucks

Practical digital libraries: books, bytes, and bucks
Do electronic marketplaces lower the price of goods?

Communications of the ACM
An empirical study on consumer acceptance of products in electronic markets: a transaction cost model

Decision Support Systems - Special issue on economics of electronic commerce
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Economics of E-Commerce: A Strategic Guide to Understanding and Designing the Online Marketplace

The Economics of E-Commerce: A Strategic Guide to Understanding and Designing the Online Marketplace
A preference-based recommender system

EC-Web'06 Proceedings of the 7th international conference on E-Commerce and Web Technologies

Towards optimal multi-item shopping basket management: heuristic approach

OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems

Quantified Score

Hi-index	0.00

Visualization

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.