A branch and bound algorithm for bi-level discrete network design problem (Q264253): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11067-012-9173-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000900837 / rank | |||
Normal rank | |||
Revision as of 14:21, 19 March 2024
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
