Optimizing a mail-order with discount and shipping costs

DOI10.1016/S0020-0190(01)00248-4zbMath1013.68289MaRDI QIDQ1603552

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)

Cites Work

• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item