Optimizing a mail-order with discount and shipping costs

DOI10.1016/S0020-0190(01)00248-4MaRDI QIDQ1603552zbMATH OpenFDO

Authors Peter Damaschke

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

optimizationalgorithmsknapsackpiecewise linear cost functions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1617257 (Why is no real title available?)
• scientific article; zbMATH DE number 1696540 (Why is no real title available?)
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• scientific article; zbMATH DE number 1418266 (Why is no real title available?)
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

This page was built for publication: Optimizing a mail-order with discount and shipping costs

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