Approximate dynamic programming for link scheduling in wireless mesh networks
type: Item
instance of: scholarly article
title: Approximate dynamic programming for link scheduling in wireless mesh networks
zbMATH Open document ID: 1278.90169
author: Vasilis Friderikos
author: Katerina Papadaki
published in: Computers \& Operations Research
publication date: 2008-05-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5278682
zbMATH Keywords: approximate dynamic programming
zbMATH Keywords: scheduling
zbMATH Keywords: wireless mesh networks
MaRDI profile type: Publication
full work available at URL: j.cor.2007.02.010
OpenAlex ID: W2019052486
cites work: Wireless mesh networks: a survey
cites work: Q5395365
cites work: Link scheduling in polynomial time
cites work: ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
cites work: An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
cites work: Handbook on modelling for discrete optimization.
cites work: Q4257216
cites work: An analysis of temporal-difference learning with function approximation
cites work: Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
DOI: 10.1016/J.COR.2007.02.010
description: scientific article; zbMATH DE number 5278682