scientific article; zbMATH DE number 4149863

Recommendations

Cited in

(39)

Kapazitätsoptimierung in paketvermittelten Datennetzen. (Capacity optimization in packet switched data networks)
On the capacity assignment problem in packet-switching computer networks
The delay capacity product for store-and-forward communication networks: tree networks
Routing and capacity assignment in backbone communication networks
Bounds for global optimization of capacity expansion and flow assignment problems
Optimization problems of transportation in communication networks with variable capacities
Upper bound of network capacity and a static optimal packet routing strategy
Routing and capacity assignment in backbone communication networks under time varying traffic conditions
A heuristic for the continuous capacity and flow assignment
An optimal capacity assignment for the robust design problem in capacitated flow networks
Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
A technique to solve packing problem for the management of perspective development of communication network nodes
Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
scientific article; zbMATH DE number 4131955 (Why is no real title available?)
scientific article; zbMATH DE number 4201998 (Why is no real title available?)
scientific article; zbMATH DE number 4209565 (Why is no real title available?)
Optimal capacity assignment in general queueing networks
scientific article; zbMATH DE number 4139463 (Why is no real title available?)
Combined capacity planning and concentrator location in computer communications networks
scientific article; zbMATH DE number 3900475 (Why is no real title available?)
scientific article; zbMATH DE number 3908345 (Why is no real title available?)
scientific article; zbMATH DE number 3922330 (Why is no real title available?)
On the selection of primary paths for a communication network
scientific article; zbMATH DE number 3978784 (Why is no real title available?)
scientific article; zbMATH DE number 98410 (Why is no real title available?)
Discrete Link Capacity and Priority Assignments in Communication Networks
scientific article; zbMATH DE number 4128364 (Why is no real title available?)
scientific article; zbMATH DE number 484567 (Why is no real title available?)
scientific article; zbMATH DE number 558538 (Why is no real title available?)
scientific article; zbMATH DE number 647749 (Why is no real title available?)
scientific article; zbMATH DE number 1990772 (Why is no real title available?)
scientific article; zbMATH DE number 2068073 (Why is no real title available?)
The flow deviation method: An approach to store‐and‐forward communication network design
Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
A combinatorial intelligent computing approach for resolving the delay and flow assignment in computer communication networks.
Capacity and flow assignment of data networks by generalized Benders decomposition
Routing and scheduling of network flows with deadlines and discrete capacity allocation
Minimum hop flow assignment and routing subject to an average message delay constraint
Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479783)