Approximate dynamic programming for link scheduling in wireless mesh networks

DOI10.1016/j.cor.2007.02.010zbMath1278.90169MaRDI QIDQ925829

Vasilis Friderikos, Katerina P. Papadaki

Publication date: 23 May 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.010

zbMATH Keywords

scheduling; approximate dynamic programming; wireless mesh networks

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

90C39: Dynamic programming

Related Items

Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach, Perfect periodic scheduling for binary tree routing in wireless networks, Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks, On-line hand-drawn electric circuit diagram recognition using 2D dynamic programming, Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks, Robust gateway placement in wireless mesh networks, Energy efficient spatial TDMA scheduling in wireless networks, FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING

Cites Work

• Unnamed Item
• Unnamed Item
• Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
• Wireless mesh networks: a survey
• Handbook on modelling for discrete optimization.
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• Link scheduling in polynomial time
• An analysis of temporal-difference learning with function approximation
• An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem