Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

DOI10.1007/s10589-007-9077-1zbMath1181.90170OpenAlexW2081198247MaRDI QIDQ953207

Krzysztof M. Walkowiak

Publication date: 17 November 2008

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

Full work available at URL: https://doi.org/10.1007/s10589-007-9077-1

zbMATH Keywords

optimizationnetwork survivabilitylagrangean relaxation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Anycasting in connection-oriented computer networks: Models, algorithms and results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• A branch-and-cut algorithm for capacitated network design problems
• Some approaches to solving a multihour broadband network capacity design problem with single-path routing
• An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A GRASP with path-relinking for private virtual circuit routing
• The flow deviation method: An approach to store‐and‐forward communication network design

This page was built for publication: Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks