The clever shopper problem

DOI10.1007/S00224-019-09917-ZMaRDI QIDQ5919456zbMATH OpenOpenAlexWikidataFDO

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

Publication date 27 February 2020

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-019-09917-z

zbMATH Keywords

clever shopperfixed-parameter tractabilityinternet shopping

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• The clever shopper problem
• Internet shopping with price sensitive discounts
• Internet shopping optimization problem
• Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
• Erratum to: ``Internet shopping with price-sensitive discounts

Cites work

• 45th International Colloquium on Automata, Languages, and Programming: ICALP 2018, Prague, Czech Republic, July 9-13, 2018
• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
• \(n\)-fold integer programming in cubic time
• A note on degree-constrained star subgraphs of bipartite graphs
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Bin packing with fixed number of bins revisited
• Clustering to minimize the maximum intercluster distance
• Combinatorial \(n\)-fold integer programming and applications
• Evaluating and tuning n-fold integer programming
• Faster Algorithms for Integer Programs with Block Structure
• Internet shopping optimization problem
• Internet shopping with price sensitive discounts
• Kernelization Lower Bounds by Cross-Composition
• Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
• On a dual version of the one-dimensional bin packing problem
• Paths, Trees, and Flowers
• Perfect Code is \(W[1]\)-complete
• Reducibility among combinatorial problems
• The clever shopper problem

Cited in

(8)

• Optimizing a mail-order with discount and shipping costs
• Erratum to: ``Internet shopping with price-sensitive discounts
• Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
• Internet shopping optimization problem
• Online Coupon Consumption Problem
• scientific article; zbMATH DE number 6469255 (Why is no real title available?)
• The clever shopper problem
• Scheduling kernels via configuration LP

This page was built for publication: The clever shopper problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919456)