Topology Knapsack Problem for Geometry Optimization
The knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack problems, no existing model simultaneously optim...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11007656/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|