A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(96)00078-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038770643 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 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
0 references
0 references
0 references
0 references
0 references
0 references
