Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing

DOI10.1016/J.EJOR.2011.11.041zbMath1244.90056OpenAlexW1963563295MaRDI QIDQ439572

Andreas Grothey, Xin'an Yang

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://repository.essex.ac.uk/8271/1/ERGO-10-008.pdf

zbMATH Keywords

stochasticapproximate dynamic programmingBézier curves/surfacesmulti-homingrouting policytop-percentile pricing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic programming (90C15) Dynamic programming (90C39) Traffic problems in operations research (90B20) Internet topics (68M11)

Related Items (2)

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters ⋮ Optimized ensemble value function approximation for dynamic programming

Cites Work

• Top percentile network pricing and the economics of multi-homing
• Top-percentile traffic routing problem by dynamic programming
• Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming
• Approximate Dynamic Programming

This page was built for publication: Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing