A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (Q4189077): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.27.3.567 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.27.3.567 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061435904 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.27.3.567 / rank | |||
Normal rank | |||
Latest revision as of 10:05, 29 December 2024
scientific article; zbMATH DE number 3626947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion |
scientific article; zbMATH DE number 3626947 |
Statements
A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (English)
0 references
1979
0 references
Heuristic Branch-And-Bound Algorithm
0 references
Telephone Feeder Capacity Expansion
0 references
Telephonic Networks
0 references
Case Study
0 references
Computational Efficiency
0 references
