A branch and bound algorithm for bi-level discrete network design problem (Q264253)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for bi-level discrete network design problem |
scientific article |
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
