Large-Scale Network Topological Optimization
From MaRDI portal
Publication:4135402
DOI10.1109/TCOM.1977.1093708zbMath0361.94044OpenAlexW1972312685MaRDI QIDQ4135402
Howard Frank, Robert Roy Boorstyn
Publication date: 1977
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcom.1977.1093708
Related Items
Topological design of a centralized communication network with unreliable links and node outage costs, A methodology for multicriteria network partitioning, Efficient algorithms for the capacitated concentrator location problem, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Perspective Reformulation and Applications, Perspective reformulations of mixed integer nonlinear programs with indicator variables, A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods, The optimal partitioning of networks, Design of computer network topologies: a Vroom inspired psychoclonal algorithm, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem, A mixed-integer approach to Core-Edge design of storage area networks, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, Lift-and-project cuts for convex mixed integer nonlinear programs, A queueing network approach to the topological optimization of linked cluster networks, Tree network design avoiding congestion, Strong-branching inequalities for convex mixed integer nonlinear programs, Topological design of telecommunication networks --- local access design methods, Topological Design of Centralized Computer Networks, Networks synthesis and optimum network design problems: Models, solution methods and applications, A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs., The \(K\)-coverage concentrator location problem, Topological design of computer communication networks -- the overall design problem, Analysis of a flow problem with fixed charges, Locating concentrators in centralized computer networks, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Topological design of wide area communication networks, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, Optimal design of a distributed network with a two-level hierarchical structure, Two-level evolutionary approach to the survivable mesh-based transport network topological design, Call admission control schemes and ATM network topological design, A heuristic approach for capacity expansion of packet networks, A cross entropy approach to design of reliable networks, Resource allocation and capacity assignment in distributed systems, The capacitated multiple allocation hub location problem: Formulations and algorithms, New modeling approaches for the design of local access transport area networks, Heuristics for the p-hub location problem, Models for planning capacity expansion in local access telecommunication networks, Integer programming formulations of discrete hub location problems, An improved branch and bound algorithm for mixed integer nonlinear programs, Hardware configuration for StarLAN 10 local area networks: An application of integer programming, A tabu search algorithm for the optimisation of telecommunication networks, Asynchronous transfer mode networks with parallel links and multiple service classes, Optimisation of the interconnecting network of a UMTS radio mobile telephone system, Optimization models for ATM network planning
