The Clever Shopper Problem

Laurent Bulteau; Danny Hermelin; Dušan Knop; Anthony Labarre; Stéphane Vialette

doi:10.1007/s00224-019-09917-z

The Clever Shopper Problem

Laurent Bulteau, Danny Hermelin, Dušan Knop, Anthony Labarre, Stéphane Vialette

Department of Industrial Engineering and Management

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which offer discounts when purchases exceed a certain threshold. Although the problem is NP-hard, we provide exact algorithms for several cases, e.g. when each shop sells only two items, and an FPT algorithm for the number of items, or for the number of shops when all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases.

Original language	American English
Pages (from-to)	17-34
Number of pages	18
Journal	Theory of Computing Systems
Volume	64
Issue number	1
DOIs	https://doi.org/10.1007/s00224-019-09917-z
State	Published - 1 Jan 2020

Keywords

Clever shopper
Fixed parameter tractability
Internet shopping

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-019-09917-z

Cite this

@article{b56357877e68416b9bf2b3f2e305b925,

title = "The Clever Shopper Problem",

abstract = "We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which offer discounts when purchases exceed a certain threshold. Although the problem is NP-hard, we provide exact algorithms for several cases, e.g. when each shop sells only two items, and an FPT algorithm for the number of items, or for the number of shops when all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases.",

keywords = "Clever shopper, Fixed parameter tractability, Internet shopping",

author = "Laurent Bulteau and Danny Hermelin and Du{\v s}an Knop and Anthony Labarre and St{\'e}phane Vialette",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/s00224-019-09917-z",

language = "American English",

volume = "64",

pages = "17--34",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - The Clever Shopper Problem

AU - Bulteau, Laurent

AU - Hermelin, Danny

AU - Knop, Dušan

AU - Labarre, Anthony

AU - Vialette, Stéphane

PY - 2020/1/1

Y1 - 2020/1/1

N2 - We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which offer discounts when purchases exceed a certain threshold. Although the problem is NP-hard, we provide exact algorithms for several cases, e.g. when each shop sells only two items, and an FPT algorithm for the number of items, or for the number of shops when all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases.

AB - We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which offer discounts when purchases exceed a certain threshold. Although the problem is NP-hard, we provide exact algorithms for several cases, e.g. when each shop sells only two items, and an FPT algorithm for the number of items, or for the number of shops when all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases.

KW - Clever shopper

KW - Fixed parameter tractability

KW - Internet shopping

UR - http://www.scopus.com/inward/record.url?scp=85064730286&partnerID=8YFLogxK

U2 - 10.1007/s00224-019-09917-z

DO - 10.1007/s00224-019-09917-z

M3 - Article

SN - 1432-4350

VL - 64

SP - 17

EP - 34

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 1

ER -

The Clever Shopper Problem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this