An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898)
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 6859033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved cut-and-solve algorithm for the single-source capacitated facility location problem |
scientific article; zbMATH DE number 6859033 |
Statements
An improved cut-and-solve algorithm for the single-source capacitated facility location problem (English)
0 references
12 April 2018
0 references
facility location
0 references
capacitated facility location
0 references
single-sourcing
0 references
cutting planes
0 references
local branching
0 references
cut-and-solve
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.860755443572998
0 references
0.7775439023971558
0 references
0.7693264484405518
0 references
0.7656497359275818
0 references
0.7617368102073669
0 references
