Multicast problems in telecommunication networks

DOI10.1007/S10288-008-0074-8MaRDI QIDQ1022443zbMATH OpenOpenAlexFDO

Authors Valeria Leggieri

Publication date 22 June 2009

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-008-0074-8

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)
• On a new class of nonlinear set covering problems arising in wireless network design
• Pure 0-1 programming approaches to wireless network design. (Summary)
• Models and algorithms for the reconfiguration of distributed wireless switching systems
• The vertex coloring problem and its generalizations

Cites work

• A survey of combinatorial optimization problems in multicast routing
• Minimum power multicasting problem in wireless networks
• Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
• The Steiner tree problem with delays: a compact formulation and reduction procedures

Cited in

(6)

• A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
• On a new class of nonlinear set covering problems arising in wireless network design
• ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
• scientific article; zbMATH DE number 1735665 (Why is no real title available?)
• A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks
• Pure 0-1 programming approaches to wireless network design. (Summary)

This page was built for publication: Multicast problems in telecommunication networks

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