Lagrangian relaxation for maximum service in multicast routing with QoS constraints
Year of publication: |
2024
|
---|---|
Authors: | Araújo, Carlos Victor Dantas ; Souza, Cid Carvalho de ; Usberti, Fábio Luiz |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 1, p. 140-166
|
Subject: | Lagrangian relaxation | multicast routing problem | quality of service constraints | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Dienstleistungsqualität | Service quality | Theorie | Theory |
-
A relax-and-price heuristic for the inventory-location-routing problem
Guerrero, W. J., (2015)
-
Wang, Ze, (2023)
-
An inventory-routing problem with the objective of travel time minimazation
Li, Kunpeng, (2014)
- More ...
-
A matheuristic for the firefighter problem on graphs
Ramos, Natanael, (2019)
-
A heuristic for the convex recoloring problem in graphs
Dantas, Ana Paula S., (2020)
-
An exact algorithm for minimizing vertex guards on art galleries
Couto, Marcelo C., (2011)
- More ...