Lagrangian relaxation for maximum service in multicast routing with QoS constraints

DOI10.1111/itor.13200WikidataQ114080800 ScholiaQ114080800MaRDI QIDQ6082266

Cid Carvalho De Souza, Fábio Luiz Usberti, Unnamed Author

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationmulticast routing problemquality of service constraints

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of combinatorial optimization problems in multicast routing
• Steiner problem in networks: A survey
• Shortest Path Problems with Resource Constraints
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic

This page was built for publication: Lagrangian relaxation for maximum service in multicast routing with QoS constraints