A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points |
scientific article; zbMATH DE number 1045750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points |
scientific article; zbMATH DE number 1045750 |
Statements
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (English)
0 references
7 August 1997
0 references
transshipment-related problem
0 references
\(p\)-median location
0 references
Lagrangean decomposition
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0.9023222
0 references
0.8940897
0 references
0.8900546
0 references
0.88986033
0 references
0.8893374
0 references
0.88280684
0 references
0.8744367
0 references
