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

DOI10.1007/S10589-007-9077-1zbMATH Open1181.90170OpenAlexW2081198247MaRDI QIDQ953207FDOQ953207

Krzysztof 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

Recommendations

• A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method
• Application of Lagrangian relaxation to computer network control
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

zbMATH Keywords

optimizationnetwork survivabilitylagrangean relaxation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953207)