The Knapsack Problem - Maple Application Center
Application Center Applications The Knapsack Problem

The Knapsack Problem

Author
: marcus .
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!

This maple worksheet will explore the 0/1 knapsack problem
which is a famous problem in combinatorial optimization.
We will solve the problem by using dynamic programming.
We will then confirm such a solution graphically by using
Maples combinat() package.

Application Details

Publish Date: December 20, 2010
Created In: Maple 13
Language: English

More Like This

Constrained Optimization
Nash Equilibrium in a Static and Dynamic Duopoly Cournot Model
The Normal Distribution and the Central Limit Theorem
Stability of Differential Equations
Dynamic Programming and the Bellman Equation
Predator and Prey Model
The Black-Litterman Asset Allocation Model
Intertemporal Consumption Dynamics
Cake Eating in Finite and Infinite Time
Simulation of Stock Paths
The Concept of Significance
Saddle Path Equilibrium in a Phase Plane and Space