https://github.com/janina280/proiectareaalgoritmilor

The Refined Knapsack Problem
https://github.com/janina280/proiectareaalgoritmilor

programming

Last synced: 10 months ago
JSON representation

The Refined Knapsack Problem

• Host: GitHub
• URL: https://github.com/janina280/proiectareaalgoritmilor
• Owner: janina280
• Created: 2023-03-14T21:49:23.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2023-06-27T15:48:03.000Z (almost 3 years ago)
• Last Synced: 2025-02-25T05:42:55.897Z (over 1 year ago)
• Topics: programming
• Language: C
• Homepage:
• Size: 176 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# ProiectareaAlgoritmilor

The Refined Knapsack Problem

Let's assume you are an investment agent with a capital C. There are n investment offers available for you to choose from. Each offer i has a certain number of shares available at a given price per share, which can bring an estimated profit of pi for each share purchased. Your task is to determine the investment that can yield the maximum estimated profit. Two different algorithms will be implemented to solve this problem.