russoz
/ multiple_knapsacks_problem.py
Created
March 17, 2022 21:35
— forked from boechat107/multiple_knapsacks_problem.py
Multiple knapsacks problem
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| Knapsacks have weight capacity; items have weight and value. | |
| We want to find the allocation of items which maximizes the total | |
| carried value. | |
| """ | |
| from typing import List, Set, Tuple | |