Pages that link to "Item:Q5454363"

The following pages link to The flow deviation method: An approach to store‐and‐forward communication network design (Q5454363):

Displaying 49 items.

• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study) (Q580158) (← links)
• Optimal routing for multiclass networks (Q666417) (← links)
• A performability-oriented approach to the design and synthesis of data networks (Q679228) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network (Q841973) (← links)
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks (Q953207) (← links)
• Maximizing residual capacity in connection-oriented networks (Q955490) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
• An algorithm for network dimensioning under reliability considerations (Q1197791) (← links)
• Optimal design of LAN-WAN internetworks: An approach using simulated annealing (Q1197793) (← links)
• Topological design of wide area communication networks (Q1197802) (← links)
• Configuring wide area computer networks. Problems and models (Q1207261) (← links)
• Resource allocation in state-dependent emergency evacuation networks (Q1266728) (← links)
• Capacity planning in manufacturing and computer networks (Q1278227) (← links)
• A heuristic approach for capacity expansion of packet networks (Q1278229) (← links)
• An algorithm for optimal minimax routing in ATM networks (Q1319832) (← links)
• Effect of model uncertainty on some optimal routing problems (Q1321333) (← links)
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
• Routing and capacity assignment in backbone communication networks (Q1373886) (← links)
• Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• Call admission control schemes and ATM network topological design (Q1806823) (← links)
• Asynchronous transfer mode networks with parallel links and multiple service classes (Q1869520) (← links)
• A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
• Integrating reliability and quality of service in networks with switched virtual circuits (Q1886726) (← links)
• Uniqueness of the solution for optimal static routing in open BCMP queueing networks (Q1905863) (← links)
• On minimum congestion routing in rearrangeable multihop lightwave networks (Q1922634) (← links)
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
• An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
• Resource allocation and capacity assignment in distributed systems (Q2564753) (← links)
• A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
• Subpopulation initialization driven by linkage learning for dealing with the long-way-to-stuck effect (Q2663449) (← links)
• Separable convexification and DCA techniques for capacity and flow assignment problems. (Q2773173) (← links)
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms (Q2861529) (← links)
• Allocating capacity in parallel queues to improve their resilience to deliberate attack (Q2892133) (← links)
• Anycasting in connection-oriented computer networks: Models, algorithms and results (Q2930587) (← links)
• <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks (Q3512541) (← links)
• (Q3936282) (← links)
• Optimal control of store-and-forward networks (Q3944435) (← links)
• Queuing effects in the solution of constrained store-and-forward network flow problems (Q4191830) (← links)
• (Q4945105) (← links)
• The projected pairwise multicommodity flow polyhedron (Q5938940) (← links)
• Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)
• Nonsmooth projection-free optimization with functional constraints (Q6642795) (← links)