Log In Sign Up

The Clever Shopper Problem

by   Laurent Bulteau, et al.

We investigate a variant of the so-called "Internet Shopping Problem" introduced by Blazewicz et al. (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. Finally, we give an approximation algorithm and hardness results for the problem of maximising the sum of discounts.


page 1

page 2

page 3

page 4


Hardness of the Generalized Coloring Numbers

The generalized coloring numbers of Kierstead and Yang offer an algorith...

On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint

In the problem of minimum connected dominating set with routing cost con...

Heuristic algorithms for the Longest Filled Common Subsequence Problem

At CPM 2017, Castelli et al. define and study a new variant of the Longe...

Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme

Weitzman (1979) introduced the Pandora Box problem as a model for sequen...

NP-hardness of sortedness constraints

In Constraint Programming, global constraints allow to model and solve m...

Assortment Optimization Under the Multivariate MNL Model

We study an assortment optimization problem under a multi-purchase choic...

Hardness Results for Weaver's Discrepancy Problem

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the ...