Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem (Q5285355)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 976005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem |
scientific article; zbMATH DE number 976005 |
Statements
Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem (English)
0 references
31 March 1997
0 references
heuristics
0 references
concave-cost, uncapacitated transshipment networks
0 references
adjacent extreme point search
0 references
tabu search
0 references
0.8588182
0 references
0.8537321
0 references
0.85178924
0 references
0.84322065
0 references
0.84137094
0 references
0.83395517
0 references
0.8317448
0 references
0.8299529
0 references
