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

Dream.In.Code > Programming Help > Computer Science

Welcome to Dream.In.Code
	Become an Expert! Join 307,145 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 1,724 people online right now. Registration is fast and FREE... Join Now! Chat LIVE With a Expert

Need Algorithim name for a problem

Need Algorithim name for a problem

Some1Wow	10 Sep, 2009 - 11:58 PM Post #1
New D.I.C Head Joined: 10 Sep, 2009 Posts: 5	Hello everyone I did not take an algorithims course so I need your help Is there an algorithim to solve this problem? . if I have a set of items and each item has a subset of items with a value. I want to find the best solution , have an item from each subset where the sum of the items <= a given number Example: I have 3 items: item1 has > p 1 : value =3 p 2 : value = 4 item2 has > p1:value = 5 p2 : value =4 item3 has > p1:value = 3 p2 : value =6 and I have a given number 12 Best Solution : item1 : p2 - item 2 : p1 -item3: p1 Sum=12 <=12 I want an algorithim name that solves this problem similar to Knapsack - Sum of subset .....etc or any algorithim that helps me solve this solution I just need the name of algorithim not the code! Thanks This post has been edited by Some1Wow: 11 Sep, 2009 - 12:04 AM
	This Post Was Helpful!

Register for Free to Make These Ads Go Away!

Kanvus	RE: Need Algorithim Name For A Problem 11 Sep, 2009 - 08:23 AM Post #2
D.I.C Regular Joined: 19 Feb, 2009 Posts: 451 Thanked: 39 times Dream Kudos: 50 My Contributions	the way you're explaining it is hard to visualize
	This Post Was Helpful!

Neumann	RE: Need Algorithim Name For A Problem 11 Sep, 2009 - 08:56 AM Post #3
I can judge a book by its cover Joined: 8 Jul, 2009 Posts: 686 Thanked: 93 times Dream Kudos: 225 My Contributions	Not every algorithm has a name. You are asking for something that may not exist. This does seem to be very similar to the Knapsack problem, except that you can only take a single element from each subset, at most. If I were you, I would check out the algorithm for the Knapsack problem to see if I can tweak it to work with your case. A simple brute-force can also solve this. This post has been edited by Neumann: 11 Sep, 2009 - 08:57 AM
	This Post Was Helpful!

Fast Reply

Reply to this topic

Start new topic

Display Mode: Standard · Switch to: Linear+ · Switch to: Outline

Track this topic · Email this topic · Print this topic · Subscribe to this forum

Time is now: 11/21/09 03:41PM

Invision Power Board v2.1.7 © 2009 IPS, Inc.

Licensed to: MediaGroup1

Advertising | Terms of Use | Privacy Policy | About Us | Site Map

Advertise on this site through Lake Quincy Media

Forum Index: Programming Help | C and C++ | VB6 | Java | VB.NET | C# | ASP.NET | PHP | ColdFusion | Perl and Python | Ruby | Databases | Other Languages | Game Programming | Mobile Development | Software Development | Computer Science | Industry News | Programming Tutorials | C++ Tutorials | Visual Basic Tutorials | Java Tutorials | VB.NET Tutorials | C# Tutorials | Linux Tutorials | PHP Tutorials | ColdFusion Tutorials | Windows Tutorials | HTML/JavaScript Tutorials | CSS Tutorials | Flash Tutorials | Web Promotion Tutorials | Graphic Design & Photoshop Tutorials | Software Development Tutorials | Database Tutorials | Other Language Tutorials | ASP.NET Tutorials | Game Programming Tutorials | WPF & Silverlight Tutorials |

Copyright 2001-2008 MediaGroup1 LLC, All Rights Reserved
A MediaGroup1 LLC Production - Version 6.0.2.1.36
Server: secure2

Search^Updated!w00t

Over 509,000 Pages! Advanced Forum Search

Live Help!

Be Social

Tutorials

Programming

Web Development

Reference Sheets

Code Snippets

DIC Chatroom

Join our IRC Chat

Bye Bye Ads

Monthly Drawing

Top Contributors

Top 10 Kudos This Month