Answers.com > Wiki Answers > Categories > Jobs & Education > Education > College Degrees > Bachelors Degrees > What is fractional knapsack problem?

What is fractional knapsack problem?

In: Bachelors Degrees [Edit categories]

Answer:

The knapsack problem is a problem in combinatorial optimization. It derives its name from the maximization problem of choosing possible essentials that can fit into one bag (of maximum weight) to be carried on a trip. A similar problem very often appears in business, combinatorics, complexity theory, cryptography and applied mathematics. Given a set of items, each with a cost and a value, then determine the number of each item to include in a collection so that the total cost is less than some given cost and the total value is as large as possible.

The decision problem form of the knapsack problem is the question "can a value of at least V be achieved without exceeding the cost C?"

For the source and more detailed information concerning this subject, click on the related links section (Answers.com) indicated below

Contributor:

Viper1usmc

First answer by Viper1usmc. Last edit by Viper1usmc. Contributor trust: 3740 [recommend contributor ]. Question popularity: 3 [recommend question].

[report abuse]

Sources and related links: [Edit]

Answers.com

Can you answer these Bachelors Degrees questions?

	Is it wrong to be nerdy in college as well as university?	Answer it!
	What discipline was Robert Venturi's first degree from Princeton?	Answer it!
	What is the difference between BS Pharmacy and BS Industrial Pharmacy?	Answer it!
	What courses to become a occupational therapist?	Answer it!
	What type of education is required to become a teacher?	Answer it!

Relevant answers:

Give an Example for knapsack problem?
pls soon answer my query....
What is the 01 knapsack problem?
Taking all the stuff out of your knapsack to find that when you repack it that it doesn't all fit it can be explain by following example; suppose we have given a basket in which we have to fill the...
What is the pseudocode for knapsack problem?
The pseudocode listed below is for the unbounded knapsack problem. operation ub-ks (n, K) // n is the total number of items, K is the capacity of the knapsack { for (int h = 0; h < K;...
What is the time complexity of algorithm to solve fractional knapsack problem using greedy paradigm?
if the objects in the knapsack are already being sorted then it requires only O(n) times to arrange the objects...so total time require by the knapsack problem is T(n)=(nlogn) because sorting the...
Write an algorithm for Knapsack Problem?
Merkle-Hellman's Knapsack algorithm is based on the NP-class "knapsack" problem, in which a series of items with different weights are put into a knapsack capable of holding a certain weight S. As an...