A cutting plane algorithm for the capacitated facility location problem (Q842775)
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 5607547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for the capacitated facility location problem |
scientific article; zbMATH DE number 5607547 |
Statements
A cutting plane algorithm for the capacitated facility location problem (English)
0 references
25 September 2009
0 references
capacitated facility location problem
0 references
mixed dicut inequalities
0 references
facet-enumeration
0 references
0.8348026871681213
0 references
0.8290420770645142
0 references
0.8096809387207031
0 references
0.8046428561210632
0 references
0.7979938387870789
0 references
