Decomposition of the location problem (Q1819693): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:47, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of the location problem |
scientific article |
Statements
Decomposition of the location problem (English)
0 references
1986
0 references
A decomposition algorithm is proposed for the location problem (LP). In addition to being suitable for the realization of branching in branch- and-bound algorithms, this algorithm provides a constructive scheme for the proof of polynomial solvability of new classes of LP and for the extension of known polynomially solvable particular cases of LP.
0 references
decomposition algorithm
0 references
location problem
0 references
branch-and-bound
0 references
