A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies (Q6050561)
From MaRDI portal
scientific article; zbMATH DE number 7739602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies |
scientific article; zbMATH DE number 7739602 |
Statements
A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies (English)
0 references
19 September 2023
0 references
heuristic
0 references
upper minimal total cost bound
0 references
NP hard problem
0 references
