Lagrangian relaxation for maximum service in multicast routing with QoS constraints-Reference-Cited by-同舟云学术

Lagrangian relaxation for maximum service in multicast routing with QoS constraints

Published:2022-08-10 Issue: Volume: Page:
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Araújo Carlos Victor Dantas¹^ORCID,de Souza Cid Carvalho¹^ORCID,Usberti Fábio Luiz¹^ORCID

Affiliation:

1. Department of Computer Theory Institute of Computing University of Campinas Campinas 13083‐852 Brazil

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Fundação de Amparo à Pesquisa do Estado de São Paulo

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13200

Reference19 articles.

1. Bee life‐based multi constraints multicast routing optimization for vehicular ad hoc networks;Bitam S.;Journal of Network and Computer Applications,2013

2. Hybr: a hybrid bio‐inspired bee swarm routing protocol for safety applications in vehicular ad hoc networks (vanets);Bitam S.;Journal of Systems Architecture,2013

3. Statistical comparisons of classifiers over multiple data sets;Demšar J.;Journal of Machine Learning Research,2006

4. Routing optimization in vehicular networks: a new approach based on multiobjective metrics and minimum spanning tree;Fazio P.;International Journal of Distributed Sensor Networks,2013

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multicast Routing Based on Data Envelopment Analysis and Markovian Decision Processes for Multimodal Transportation;Applied Sciences;2024-03-04

2. New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion;International Journal of Applied Mathematics and Computer Science;2024