Minimum cost of job assignment in polynomial time by adaptive unbiased filtering and branch-and-bound algorithm with the best predictor
The minimum cost of job assignment (Min-JA) is one of the practical NP-hard problems to manage the optimization in science-and-engineering applications. Formally, the optimal solution of the Min-JA can be computed by the branch-and-bound (BnB) algorithm (with the efficient predictor) in O(n!), n = p...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-06-01
|
| Series: | Intelligent Systems with Applications |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2667305325000286 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|