A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6599292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem |
scientific article; zbMATH DE number 6599292 |
Statements
29 June 2016
0 references
mixed integer programming
0 references
Lagrangean relaxation
0 references
capacitated facility location
0 references
subgradient optimization
0 references
volume algorithm
0 references
branch and bound
0 references
0 references
0 references
0 references
A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (English)
0 references
0.8907633423805237
0 references
0.8593155145645142
0 references
0.8413877487182617
0 references
0.8413872122764587
0 references
0.8389692306518555
0 references
