CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Optimizing a mail-order with discount and shipping costs

Peter Damaschke (Institutionen för datavetenskap, Algoritmer)
Information Processing Letters (0020-0190). Vol. 82 (2002), 2, p. 93-97.
[Artikel, refereegranskad vetenskaplig]

We address the problem of minimizing the total cost of a mail-order if a customer can choose among different companies. These companies may offer the items in his shopping list at different prices, and they add some charges or give discount, depending on the total value of ordered goods. While this optimization problem is hard in general, we show that it can be efficiently solved for some typical discount policies, either exactly or by invoking an approximation scheme for the Knapsack problem.

Nyckelord: algorithms, optimization, piecewise linear cost functions, knapsack

Denna post skapades 2006-09-25. Senast ändrad 2015-02-11.
CPL Pubid: 1955


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap, Algoritmer (2002-2004)


Information Technology

Chalmers infrastruktur