Retail life
Reflections on retail industry and technology
Retail Discount Concurrency Control - Examples
Retailers sometimes want to control how discounts are applied. Today, we will share a few examples....
Author: Zhiyi Zhang Date: 01/05/2017
Branch and Bound for Retail Discount Knapsack Problem
We have discussed dynamic programming extensively. Today we introduce branch and bound algorithm....
Author: Zhiyi Zhang Date: 01/04/2017
Discount Knapsack Dynamic Programming Optimization – Ordering
Dynamic programming for discount knapsack problem requires pre-ordering of the basic discount...
Author: Zhiyi Zhang Date: 12/20/2016
Discount Knapsack Dynamic Programming Optimization – Purging II
We knew we could we simplify the discount knapsack problem by purging. Now, let’s get to technical...
Author: Zhiyi Zhang Date: 12/19/2016
Discount Knapsack Dynamic Programming – Bounded I
So far, we have mostly talked about unbounded discount knapsack problem, or unbounded...
Author: Zhiyi Zhang Date: 12/16/2016
Discount Knapsack Dynamic Programming Optimization – Purging I
Prerequisite: please make sure you’re familiar with the basics of the dynamic programming. Either...
Author: Zhiyi Zhang Date: 12/15/2016
Discount Best Deal Algorithm – Mixing in Compounded Discounts II
In the first post, we mentioned that compounding may invalidate dynamic programming, actually, any...
Author: Zhiyi Zhang Date: 12/13/2016
Discount Best Deal Algorithm – Mixing in Compounded Discounts I
I love dynamic programming: It’s simple and fast for retail discount best deal problem. There is a...
Author: Zhiyi Zhang Date: 12/12/2016
Discount Knapsack Dynamic Programming Optimization – Pruning
Update - this blog post has been moved to Dynamics 365 Community. Earlier, we introduced dynamic...
Author: Zhiyi Zhang Date: 12/09/2016
Discount Best Deal Algorithm Performance
As we discussed before, retail discount best deal problem is a multi-dimensional integer knapsack...
Author: Zhiyi Zhang Date: 12/08/2016
Retail Discount Concurrency – Favor Retailer
In an early post, we talked about the best deal for the customer. Now, we’re talking about something...
Author: Zhiyi Zhang Date: 12/07/2016
Dynamic Programming for Retail Discount Knapsack Problem
Update - this blog post has been moved to Dynamics 365 Community. Earlier, we explained that retail...
Author: Zhiyi Zhang Date: 12/06/2016
Retail Discount Concurrency – Compounded Discounts
Retailers love compounding discounts. Just the other day, I saw 50% off on top of another 50% off....
Author: Zhiyi Zhang Date: 12/06/2016
Retail Discount Concurrency – Best Deal Knapsack Problem
Update - the blog post has been moved to Dynamics 365 Community. What happens when a product is...
Author: Zhiyi Zhang Date: 12/05/2016