A branch and cut algorithm for the hierarchical network design problem (Q2379520)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and cut algorithm for the hierarchical network design problem |
scientific article; zbMATH DE number 5685121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and cut algorithm for the hierarchical network design problem |
scientific article; zbMATH DE number 5685121 |
Statements
A branch and cut algorithm for the hierarchical network design problem (English)
0 references
19 March 2010
0 references
extensive facility location
0 references
cutting planes
0 references
0 references
0 references
0.8169277906417847
0 references
0.8149620294570923
0 references
0.801837682723999
0 references
0.8011482357978821
0 references
