Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic

DOI10.1111/itor.12605OpenAlexW2902945229WikidataQ128855717 ScholiaQ128855717MaRDI QIDQ6066592

Unnamed Author, Cid Carvalho De Souza, Celso Carneiro Ribeiro

Publication date: 16 November 2023

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

Full work available at URL: https://doi.org/10.1111/itor.12605

zbMATH Keywords

heuristicsinteger programmingquality of servicemulticast routingad hoc networksrelax-and-fixvehicular networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

A rolling-horizon approach for multi-period optimization ⋮ Lagrangian relaxation for maximum service in multicast routing with QoS constraints ⋮ Allocating revenues in a Smart TV ecosystem ⋮ A kernel search heuristic for the multivehicle inventory routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• Mathematical aspects of network routing optimization.
• A heuristic approach to hard constrained shortest path problems
• A survey of combinatorial optimization problems in multicast routing
• Minimum diameter cost-constrained Steiner trees
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• Optimization by GRASP
• A dual ascent approach for steiner tree problems on a directed graph
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• A dual algorithm for the constrained shortest path problem
• Minimum Diameter Spanning Trees and Related Problems
• A tabu search heuristic for the Steiner Tree Problem
• Solving Steiner tree problems in graphs to optimality
• Preprocessing Steiner problems from VLSI layout
• Shortest Path Problems with Resource Constraints
• A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
• Steiner tree problems

This page was built for publication: Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic