An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem (Q2840722)
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 6190255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem |
scientific article; zbMATH DE number 6190255 |
Statements
23 July 2013
0 references
network design
0 references
\(m\)-ring-star
0 references
branch-and-cut
0 references
integer programming
0 references
An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem (English)
0 references
0.9385881423950196
0 references
0.8785930275917053
0 references
0.8687363266944885
0 references
0.8686062693595886
0 references
0.8686060309410095
0 references
