---
title: ILP-HPMA-Herbologist
canonical_url: "https://www.modelscope.cn/studios/OhMyDearAI/ILP-HPMA-Herbologist"
md_url: "https://www.modelscope.cn/studios/OhMyDearAI/ILP-HPMA-Herbologist.md"
repository: OhMyDearAI/ILP-HPMA-Herbologist
chinese_name: "HPMA疯狂藤蔓预算凑单工具"
last_updated: 2025-09-22
sdk_type: gradio
sdk_version: 4.31.3
downloads: 0
stars: 117
---

# ILP-HPMA-Herbologist

> ILP-HPMA-Herbologist - OhMyDearAI 在 ModelScope 创建的在线 Demo。This space is used to assist in calculating the combinations of plant quantities for sale based on ILP, in order to maximize the acquisition budget of Gabby. In Bounded Knapsack Problem, each item has…

OhMyDearAI/ILP-HPMA-Herbologist 是 ModelScope 魔搭社区上的在线可交互 Demo（创空间），基于 gradio 4.31.3 构建，中文名为「HPMA疯狂藤蔓预算凑单工具」。

- **Repository**: OhMyDearAI/ILP-HPMA-Herbologist
- **SDK**: gradio
- **SDK version**: 4.31.3
- **Downloads**: 0
- **Stars**: 117
- **Last updated**: 2025-09-22

Source: https://www.modelscope.cn/studios/OhMyDearAI/ILP-HPMA-Herbologist

---

#### Clone with HTTP
```bash
 git clone https://www.modelscope.cn/studios/OhMyDearAI/ILP-HPMA-Herbologist.git
```

In the Subset Sum Problem, the objective is to determine whether there is a subset of a given set of integers whose sum is equal to a specific target value. This problem is a special case of the Knapsack Problem where each item has the same weight as its value.

In Bounded Knapsack Problem, each item has a maximum limit on the number of times it can be selected. The objective is to determine the combination of items, respecting these limits, that either maximizes or meets a specific target value.