A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks

DOI10.1287/OPRE.40.4.678MaRDI QIDQ4022925zbMATH OpenOpenAlexFDO

Authors Peter C. Fetterolf, G. (Anand) Anandalingam

Publication date 17 January 1993

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.40.4.678

zbMATH Keywords

bridgesLagrangian relaxation algorithmlocal area networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18) Applications of mathematical programming (90C90)

Recommendations

• Revisiting Lagrangian relaxation for network design
• Application of Lagrangian relaxation to computer network control
• A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks
• scientific article; zbMATH DE number 4104746
• scientific article; zbMATH DE number 1795201
• scientific article; zbMATH DE number 35750
• Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks
• Optimization of a topologically tree-based local area network
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

Cited in

(13)

• Application of Lagrangian relaxation to computer network control
• Performance modeling and optimization of networks of bridged LANs
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
• KKT transformation approach for multi-objective multi-level linear programming problems
• Revisiting Lagrangian relaxation for network design
• Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.
• OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing
• scientific article; zbMATH DE number 4104746 (Why is no real title available?)
• A Lagrangian relaxation approach for expansion of a highway network
• Suboptimal-optimal routing for LAN internetworking using transparent bridges
• LP-based heuristic algorithms for interconnecting token rings via source routing bridges
• A modified subgradient algorithm for Lagrangean relaxation
• Optimal locations of switches and interconnections for ATM LANs

This page was built for publication: A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks

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