A branch and bound algorithm for primary routes assignment in survivable connection oriented networks

DOI10.1023/B:COAP.0000008650.91314.59zbMath1044.90093OpenAlexW2051893873MaRDI QIDQ1424781

Krzysztof M. Walkowiak

Publication date: 15 March 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000008650.91314.59

zbMATH Keywords

branch and bound algorithmsurvivable networksflow assignment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks ⋮ Maximizing residual capacity in connection-oriented networks

This page was built for publication: A branch and bound algorithm for primary routes assignment in survivable connection oriented networks