Decomposition of the location problem (Q1819693)
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: Decomposition of the location problem |
scientific article; zbMATH DE number 3993253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of the location problem |
scientific article; zbMATH DE number 3993253 |
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
0.92041653
0 references
0.91889226
0 references
0 references
0.8840126
0 references
0.88214016
0 references
0 references
0.87935317
0 references
0.8791444
0 references
