Backbone Network Design Tools with Economic Tradeoffs
From MaRDI portal
Publication:4025918
DOI10.1287/ijoc.2.3.236zbMath0755.90024OpenAlexW2090532016MaRDI QIDQ4025918
Bezalel Gavish, Kemal Altinkemer
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.3.236
Lagrangian relaxationlower boundssubgradient optimizationheuristic methodbackbone networkrouting and link capacities
Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Exact approaches to the single-source network loading problem, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, Routing and capacity assignment in backbone communication networks, Bidirected and unidirected capacity installation in telecommunication networks., A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs., Topological design of computer communication networks -- the overall design problem, A system for priority routing and capacity assignment in packet switched networks, Topological design of wide area communication networks, Algorithms for an integer multicommodity network flow problem with node reliability considerations, Configuring wide area computer networks. Problems and models, Separable convexification and DCA techniques for capacity and flow assignment problems, Algorithms for the non-bifurcated network design problem, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs, The network redesign problem for access telecommunications networks, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, New formulations and solution procedures for the hop constrained network design problem., Primary and secondary route selection in backbone communication networks, Capacity planning in manufacturing and computer networks, A branch and price approach for the robust bandwidth packing problem with queuing delays, Resource allocation and capacity assignment in distributed systems, Routing and capacity assignment in backbone communication networks under time varying traffic conditions, Diversification strategies in local search for a nonbifurcated network loading problem, An efficient heuristic to dimension large-scale hybrid optoelectronic networks, Asynchronous transfer mode networks with parallel links and multiple service classes
