Algorithms for designing optimized fixed broadband networks

MaRDI QIDQ3565729zbMATH OpenFDO

Authors Henryk Gierszal, Joanna Modławska, Dominik Kasprzak, Krzysztof Liszyński, Tomasz Piaścik

Publication date 7 June 2010

zbMATH Keywords

dynamic programmingcommunication networkstravelling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 432987
• The telecommunication network optimal topology designing
• Cost optimized layout of fibre optic networks in the access net domain
• Topological design of telecommunication networks --- local access design methods
• Topological optimization of the large-scale data transmission networks

Cited in

(3)

• scientific article; zbMATH DE number 5014521 (Why is no real title available?)
• Hitting Buneman circles
• An Algorithm for the Design of Multitype Concentrator Networks

This page was built for publication: Algorithms for designing optimized fixed broadband networks

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