A branch and bound algorithm for bi-level discrete network design problem (Q264253)
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 bound algorithm for bi-level discrete network design problem |
scientific article; zbMATH DE number 6561420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for bi-level discrete network design problem |
scientific article; zbMATH DE number 6561420 |
Statements
A branch and bound algorithm for bi-level discrete network design problem (English)
0 references
31 March 2016
0 references
network design problem
0 references
bi-level programming
0 references
branch and bound
0 references
outer approximation
0 references
0 references
0 references
0 references
0 references
0 references
0.7885627746582031
0 references
0.7660589218139648
0 references
0.7656239867210388
0 references
0.7502198219299316
0 references
0.7474356889724731
0 references
