LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY

DOI10.1080/03081078308960802MaRDI QIDQ3964470zbMATH OpenOpenAlexFDO

Authors Boris S. Veroy

Publication date 1983

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081078308960802

zbMATH Keywords

network topologypretopologynode locationscontinuous parameterizationinteractive synthesisleast cost network architecturetransmission and switching optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Topological optimization of the large-scale data transmission networks
• scientific article; zbMATH DE number 4110635
• scientific article; zbMATH DE number 4112411
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Models and complexity of problems of design and reconstruction of telecommunication and transport systems

Cites work

• A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
• A branch‐bound algorithm for the capacitated facilities location problem
• A note on Fermat's problem
• An Application of Dynamic Programming to Location—Allocation Problems
• An algorithm for certain multi‐commodity flow problems
• An algorithm for nonlinear multicommodity flow problems
• Exact and approximate solutions to the multisource weber problem
• Generalized multi‐stage connection networks
• Heuristic Methods for Location-Allocation Problems
• Location-Allocation Problems
• Minimum cost routing for dynamic network models
• Minimum cost routing for static network models
• On building minimum cost communication networks
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Optimal Facility Location with Concave Costs
• Optimal design of centralized computer networks
• Properties of a multifacility location problem involving euclidian distances
• Routing in computer networks
• Site Location via Mixed-integer Programming
• The m-Center Problem
• The Optimum Location of Multi-centres on a Graph
• The complexity of the network design problem

Cited in

(3)

• Optimal search algorithm for extrema of a discrete periodic bimodal function
• Communication network designing: transmission capacity, cost and scalability
• Topological optimization of the large-scale data transmission networks

This page was built for publication: LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY

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