A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.

DOI10.1007/BF03398577zbMath1141.90348OpenAlexW2775189660MaRDI QIDQ2468608

Amitava Dutta, Rakesh Kawatra, Dennis L. Bricker

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398577

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Topological design of a centralized communication network with unreliable links and node outage costs
• A multiperiod planning model for the capacitated minimal spanning tree problem
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• The complexity of the capacitated tree problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Backbone Network Design Tools with Economic Tradeoffs
• Computing capacitated minimal spanning trees efficiently
• Large-Scale Network Topological Optimization
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Validation of subgradient optimization
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Optimal design of centralized computer networks