GitHub

branch-and-bound

OplaPlanner has moved to https://github.com/apache/incubator-kie-drools. This repository is archived. OptaPlanner is an AI constraint solver in Java to optimize the ...
note

Pythonで線形計画法！最適化ライブラリ「PuLP」

ソルバーを切り替えて使える（無料のCBCや、有料のGurobiなど） 線形計画法（LP）・混合整数計画法（MILP）に対応 この記事では、 「荷物をどれだけ積めるか？ 」 という、定番の ナップサック問題（Knapsack Problem） を題材にPuLPを用いた最適化を実施してみます。
note

If you have basic knowledge, you can reach Brown, so everyone should start AtCoder

On January 14, 2024, five months into AtCoder, I reached Brown, so I am writing this post to introduce myself and share my journey. My rating dropped a bit after getting a gray performance with 2 ...
KDnuggets

Genetic Programming in Python: The Knapsack Problem

Editor's note: As pointed out by reader Monem in the comments below, this is an example of using a genetic algorithm to solve the knapsack problem, not genetic ...
GitHub

knapsack-problem-dynamic

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...
blog.csdn

动态规划十大经典案例（Dynamic Programming Practice Problems）

原创 最新推荐文章于 2025-06-03 21:52:41 发布 · 7.3k 阅读 动态规划（Dynamic Programming）是求多阶段决策过程（Multistep Decision Process）最优化的一种数学方法，它将问题的整体按时间或空间的特征分成若干个前后衔接的时空阶段，把多阶段决策问题表示为前后有关的一 ...