School Assignment? Project Due Tomorrow? Chat LIVE With A Programming Expert!

Programming Help

Web Development



What's Here?

  • Members: 300,425
  • Replies: 826,035
  • Topics: 137,457
  • Snippets: 4,419
  • Tutorials: 1,148
  • Total Online: 1,493
  • Members: 81
  • Guests: 1,412

Welcome to Dream.In.Code
Become an Expert!

Join 300,425 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 1,493 people online right now. Registration is fast and FREE... Join Now!




Multidimensional 0-1 knapsack problem

 

Multidimensional 0-1 knapsack problem, Problems with turning recursive formula into a code.
rekurencja

5 Jun, 2009 - 10:33 AM
Post #1

New D.I.C Head
*

Joined: 5 Jun, 2009
Posts: 1
Dear experts,

I've found a dynamic programming recursive formula for Multidimensional 0-1 knapsack problem, on the internet but unfortunately i am not able to implement it. I would be glad if You could show me the pseudo code. For me the formula is not clear and I don't know how do it (despite, i know classic single dimension 0-1 knapsack problem well) http://books.google.com/books?hl=pl&lr...ERmrs#PPA248,M1 (Page 248)

Thank You. cool.gif


User is offlineProfile CardPM
+Quote Post


simsim00

RE: Multidimensional 0-1 Knapsack Problem

19 Jun, 2009 - 07:40 AM
Post #2

New D.I.C Head
*

Joined: 16 Jun, 2009
Posts: 9
hey bro! what do you precisely mean by multi dimensional.
im also taking the fundamentals of algos course but yet havent studied multidimensional approach.
User is offlineProfile CardPM
+Quote Post

Fast ReplyReply to this topicStart new topic

Time is now: 11/8/09 12:19AM
Invision Power Board v2.1.7 © 2009  IPS, Inc.
Licensed to: MediaGroup1

Live Help!

Be Social

Dream.In.Code RSS Feed Dream.In.Code LinkedIn Group Follow Us On Twitter Fan Us On Facebook

Tutorials

Programming

Web Development

Reference Sheets

Code Snippets

DIC Chatroom

Bye Bye Ads

Monthly Drawing

Thumb Drive

Top Contributors

Top 10 Kudos This Month