A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:50, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points |
scientific article |
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
