Optimizing a mail-order with discount and shipping costs

DOI10.1016/S0020-0190(01)00248-4zbMATH Open1013.68289MaRDI QIDQ1603552FDOQ1603552

Authors: Peter Damaschke 

Publication date: 14 July 2002

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

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

zbMATH Keywords

optimizationalgorithmsknapsackpiecewise linear cost functions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)