A branch-and-cut algorithm for the plant-cycle location problem (Q4661044)
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 2151538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the plant-cycle location problem |
scientific article; zbMATH DE number 2151538 |
Statements
A branch-and-cut algorithm for the plant-cycle location problem (English)
0 references
4 April 2005
0 references
optimization
0 references
mathematical programming
0 references
telecommunications
0 references
0.8140527606010437
0 references
0.793002188205719
0 references
0.7747189998626709
0 references
0.7642243504524231
0 references
0.7629926800727844
0 references
