#

mit-6-100b

Here is 1 public repository matching this topic...

arindam-codes / knapsack-portfolio-optimization-python

0/1 Knapsack problem implementation using greedy algorithms for stock portfolio optimization (MIT 6.100B)

python optimization decision-making portfolio-optimization quantitative-finance numerical-methods operations-research knapsack-problem greedy-algorithm resource-allocation combinatorial-optimization algorithm-design data-structures-and-algorithms algorithmic-thinking mit-6-100b

Updated May 2, 2026
Python

Improve this page

Add a description, image, and links to the mit-6-100b topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the mit-6-100b topic, visit your repo's landing page and select "manage topics."