{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:31:26Z","timestamp":1780367486442,"version":"3.54.1"},"reference-count":14,"publisher":"University of Zielona G\u00f3ra, Poland","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,1]]},"abstract":"Internet shopping optimization problem<\/jats:title>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.<\/jats:p>","DOI":"10.2478\/v10006-010-0028-0","type":"journal-article","created":{"date-parts":[[2010,7,3]],"date-time":"2010-07-03T06:34:38Z","timestamp":1278138878000},"page":"385-390","source":"Crossref","is-referenced-by-count":20,"title":["Internet shopping optimization problem"],"prefix":"10.61822","volume":"20","author":[{"given":"JACEK","family":"B\u00a3A Z\u00ffEWICZ","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u0119drzej","family":"Musia\u0142","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Urbanski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"37438","reference":[{"key":"1","unstructured":"Crescenzi, P. and Kann, V. (2008). A compendium of NP optimization problems http:\/\/www.nada.kth.se\/~viggo\/wwwcompendium\/<\/a>"},{"key":"2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979"},{"key":"3","unstructured":"Gemius, S. (2008). E-commerce in Poland http:\/\/gemius.pl\/pl\/raporty\/2008-06\/03<\/a>"},{"key":"4","unstructured":"Horrigan, J. (2008). On-line Shopping<\/i>, Pew Research Center http:\/\/www.pewinternet.org\/~\/media\/\/Files\/Reports\/2008\/PIP_Onlinepping.pdf<\/a>"},{"key":"5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/978-3-642-58327-8_30","volume-title":"Handbook on Electronic Commerce","author":"S. Klein","year":"2000"},{"key":"6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-58327-8_13","volume-title":"Handbook on Electronic Commerce","author":"C. Langdon","year":"2000"},{"issue":"1","key":"7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/268092.268122","article-title":"Do electronic marketplaces lower the prices of goods?","volume":"41","author":"H. Lee","year":"1998","journal-title":"Communications of the ACM"},{"key":"8","volume-title":"Practical Digital Libraries: Books, Bytes and Bucks","author":"M. Lesk","year":"1997"},{"issue":"1","key":"9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0167-9236(98)00061-X","article-title":"An empirical study on consumer acceptance of products in electronic markets: A transactional cost model","volume":"21","author":"T. Liang","year":"1998","journal-title":"Decision Support Systems"},{"issue":"1","key":"10","first-page":"59","article-title":"A customer assistance system: Optimizing basket cost","volume":"34","author":"J. Musia\u0142","year":"2009","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"11","first-page":"475","article-title":"A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP","author":"R. Raz","year":"1997"},{"key":"12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/11823865_4","volume-title":"E-Commerce and Web Technologies","volume":"4082","author":"B. Satzger","year":"2006"},{"key":"13","first-page":"265","volume-title":"Handbook on Electronic Commerce","author":"K. Tolle","year":"2000"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214542","volume-title":"The Economics of E-Commerce. A Strategic Guide to Understanding and Designing the On-line Marketplace","author":"N. Vulkan","year":"2003"}],"container-title":["International Journal of Applied Mathematics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/amcs\/20\/2\/article-p385.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/amcs.2010.20.issue-2\/v10006-010-0028-0\/v10006-010-0028-0.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T10:27:45Z","timestamp":1709202465000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/v10006-010-0028-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,1]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/v10006-010-0028-0","relation":{},"ISSN":["1641-876X"],"issn-type":[{"value":"1641-876X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6,1]]}}}