LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
From MaRDI portal
Publication:3964470
DOI10.1080/03081078308960802zbMath0498.94027MaRDI QIDQ3964470
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
network topology; pretopology; node locations; continuous parameterization; interactive synthesis; least cost network architecture; transmission and switching optimization
90B10: Deterministic network models in operations research
94C15: Applications of graph theory to circuits and networks
Related Items
Cites Work
- Location-Allocation Problems
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
- On building minimum cost communication networks
- An algorithm for nonlinear multicommodity flow problems
- The complexity of the network design problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Optimal Facility Location with Concave Costs
- Heuristic Methods for Location-Allocation Problems
- An Application of Dynamic Programming to Location—Allocation Problems
- A branch‐bound algorithm for the capacitated facilities location problem
- The m-Center Problem
- The Optimum Location of Multi-centres on a Graph
- Minimum cost routing for static network models
- Site Location via Mixed-integer Programming
- Optimal design of centralized computer networks
- Routing in computer networks
- An algorithm for certain multi‐commodity flow problems
- Exact and approximate solutions to the multisource weber problem
- Generalized multi‐stage connection networks
- A note on Fermat's problem
- Properties of a multifacility location problem involving euclidian distances
- Minimum cost routing for dynamic network models
