LP-based heuristic algorithms for interconnecting token rings via source routing bridges

DOI10.1023/A:1009622011925MaRDI QIDQ556719zbMATH OpenFDO

Authors June S. Park, Bezalel Gavish, Varadharajan Sridhar

Publication date 22 June 2005

Published in Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

mixed integer linear programmulticommodity flowcapacitated network designLP-based heuristicssource routing bridge

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1487910
• Topological design of computer communication networks -- the overall design problem
• A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
• Topological design of ring networks
• scientific article; zbMATH DE number 432987

Cited in

(6)

• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies
• Suboptimal-optimal routing for LAN internetworking using transparent bridges
• Performance modeling and optimization of networks of bridged LANs
• MILP-based heuristics for the design of rural community electrification projects
• A survey on Benders decomposition applied to fixed-charge network design problems

This page was built for publication: LP-based heuristic algorithms for interconnecting token rings via source routing bridges

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