Constrained Path Optimization Task
(Redirected from Constrained Optimal-Path Search Task)
Jump to navigation
Jump to search
See: Path Optimization Task, Constrained Optimization Task, Unconstrained Path Optimization Task, Constrained Route Optimization.
References
2011
- (Lang, Delgado, et al., 2011) ⇒ Kevin Lang, Joaquin Delgado, Dongming Jiang, Bhaskar Ghosh, Shirshanka Das, Amita Gajewar, Swaroop Jagadish, Arathi Seshan, Chavdar Botev, Michael Bindeberger-Ortega, Sunil Nagaraj, and Raymie Stata. (2011). “Efficient Online Ad Serving in a Display Advertising Exchange.” In: Proceedings of the fourth ACM International Conference on Web search and data mining (WSDM 2011). doi:10.1145/1935826.1935879
- QUOTE: We introduce and formalize a novel constrained path optimization problem that is the heart of the real-time ad serving task in the Yahoo! (formerly RightMedia) Display Advertising Exchange.
2002
- (Zhu & Corson, 2002) ⇒ Chenxi Zhu, and M. Scott Corson. (2002). “QoS routing for mobile ad hoc networks.” In: Proceedings of IEEE INFOCOM
- QUOTE: … Without causing confusion the terms path and route are used interchangeably. … QoS routing requires not only to find a route from a source to a destination, but a route that satisfies the end-to-end QoS requirement, often given in terms of bandwidth or delay.