KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I have a list of products , which consists of list of shops , which sold it. { 'Book A': [ShopA, ShopB, ShopC], 'Book B': [ShopC, ShopD], 'Movie C': [ShopA, ShopB, ShopD, ShopE], ... } (Price differs between the shops) Each shop is also has a shipping cost. It's a "per-order" shipping cost, it doesn't matter how many items are in my cart. And it differs between the shops too. Ex: if I buy "Book A" from ShopA, "Book B" from ShopC and "Movie C" from ShopA, the resulting price is: Book A price in ShopA + Book B price in ShopC + Movie C price in ShopA + ShopC shipping cost + ShopA shipping cost If the shipping cost was zero or it was on per-item basis and constant, than I would just sort the offer lists by price+shipping field and fetch the first result from each set. I need to buy all the items once and find the minimal price and the resulting set. I'm not very good with optimization algorithms and dynamic programming so I need a solution or just a nod into the right direction.
Tags (comma-separated)
Save Edits
Cancel