Dimensioning multicast-enabled communications networks
From MaRDI portal
Recommendations
- Multicommodity network flow models and algorithms in telecommunications
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Branch-and-price algorithm for a multicast routing problem
- Backbone Network Design Tools with Economic Tradeoffs
- Multicommodity network design with discrete node costs
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A primal-dual approximation algorithm for generalized Steiner network problems
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- On implementing the push-relabel method for the maximum flow problem
- Solving Steiner tree problems in graphs to optimality
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
Cited in
(4)
This page was built for publication: Dimensioning multicast-enabled communications networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150132)