Multicommodity network flow models and algorithms in telecommunications
From MaRDI portal
Recommendations
- Discrete cost multicommodity network optimization problems and exact solution methods
- A model for the design of a minimum-cost telecommunications network
- Optimal solution of the discrete cost multicommodity network design problem
- Multicommodity flow problems and decomposition in telecommunications networks
- scientific article; zbMATH DE number 1184420
Cited in
(28)- Large scale linear programs and heuristics for the design of survivable telecommunication networks
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- Discrete cost multicommodity network optimization problems and exact solution methods
- Component importance measures for multi-industry vulnerability of a freight transportation network
- Multilevel flow control in telecommunication networks
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)
- Optimal solution of the discrete cost multicommodity network design problem
- Chance-constrained problems and rare events: an importance sampling approach
- A model for the design of a minimum-cost telecommunications network
- Lexicographical minimization of routing hops in telecommunication networks
- Dimensioning multicast-enabled communications networks
- scientific article; zbMATH DE number 3864950 (Why is no real title available?)
- Multicommodity network design with discrete node costs
- Product Multicommodity Flow in Wireless Networks
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Network design and dynamic routing under queueing demand
- scientific article; zbMATH DE number 1487908 (Why is no real title available?)
- Optimal network design with end-to-end service requirements
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Multicommodity flow problems and decomposition in telecommunications networks
- scientific article; zbMATH DE number 5585902 (Why is no real title available?)
- A multi-period network design problem for cellular telecommunication systems
- Routing and scheduling of network flows with deadlines and discrete capacity allocation
- The decomposition of a communication network considering traffic demand interrelations
- Experiments on virtual private network design with concave capacity costs
This page was built for publication: Multicommodity network flow models and algorithms in telecommunications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294047)
