Topological design of centralized computer networks—formulations and algorithms
From MaRDI portal
Publication:3956857
DOI10.1002/net.3230120402zbMath0493.94021OpenAlexW2017127755MaRDI QIDQ3956857
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120402
computer communication networksefficient algorithmminimal spanning treeheterogeneous network design problemsTelpak problem
Applications of graph theory to circuits and networks (94C15) Theory of software (68N99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Topological design of a centralized communication network with unreliable links and node outage costs, Optimization of wireless sensor networks deployment with coverage and connectivity constraints, Survivability in hierarchical telecommunications networks, Edge exchanges in the degree-constrained minimum spanning tree problem, Efficient algorithms for the capacitated concentrator location problem, Unnamed Item, Heuristics for unequal weight delivery problems with a fixed error guarantee, Small degree out‐branchings, Variable neighborhood search for the degree-constrained minimum spanning tree problem, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, An algorithm for \(k^{\text{th}}\) minimum spanning tree, Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations, Solution procedures for the service system design problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs, Hierarchical location-allocation problems: A classification scheme, Two Matching Based Algorithm for Tree Network Design, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem, A Lagrangean approach to the degree-constrained minimum spanning tree problem, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints, Minimax regret spanning arborescences under uncertain costs, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms, The Minimum Spanning Tree Problem with Time Window Constraints, Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., RAMP for the capacitated minimum spanning tree problem, Tree network design avoiding congestion, The capacitated maximal covering location problem with backup service, Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs., Heuristics for the multi-level capacitated minimum spanning tree problem, Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs, A multiperiod planning model for the capacitated minimal spanning tree problem, A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem, A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees, The hierarchical network design problem with transshipment facilities, Topological design of telecommunication networks --- local access design methods, Finding minimum cost directed trees with demands and capacities, The multi-weighted Steiner tree problem, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Ejection chain and filter-and-fan methods in combinatorial optimization, Topological design of computer communication networks -- the overall design problem, Ejection chain and filter-and-fan methods in combinatorial optimization, Configuration of fully replicated distributed database system over wide area networks, Locating concentrators in centralized computer networks, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Topological design of wide area communication networks, Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry, Star \(p\)-hub median problem with modular arc capacities, The multi-hour service system design problem, Optimal design of a distributed network with a two-level hierarchical structure, Configuring wide area computer networks. Problems and models, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, A survey on Benders decomposition applied to fixed-charge network design problems, Branch and cut methods for network optimization, Using Lagrangian dual information to generate degree constrained spanning trees, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, The design of service systems with queueing time cost, workload capacities and backup service, Minimal spanning trees with a constraint on the number of leaves, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, Resource allocation and capacity assignment in distributed systems, Heuristic procedure neural networks for the CMST problem, The vertex degrees of minimum spanning trees, Design of capacitated degree constrained min-sum arborescence, A successful algorithm for solving directed Hamiltonian path problems, A multiperiod degree constrained minimal spanning tree problem, Savings based ant colony optimization for the capacitated minimum spanning tree problem, A successful algorithm for the undirected Hamiltonian path problem, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Hardware configuration for StarLAN 10 local area networks: An application of integer programming, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Cites Work
