Mobile Transit Trip Planning with Real–Time Data, J. Jariyasunant, D. Work, B. Kerkez, R. Sengupta, S. Glaser, and A. Bayen Transportation Research Board 89th Annual Meeting, Washington, D.C., Jan[removed], 2010. Mobile

First Page		Document Content
Date: 2015-01-21 14:55:55 Operations research Routing algorithms Network theory Shortest path problem Network flow Routing Flow network Floyd–Warshall algorithm Dynamic programming Mathematics Graph theory Theoretical computer science		Mobile Transit Trip Planning with Real–Time Data, J. Jariyasunant, D. Work, B. Kerkez, R. Sengupta, S. Glaser, and A. Bayen Transportation Research Board 89th Annual Meeting, Washington, D.C., Jan[removed], 2010. Mobile Add to Reading List Source URL: bayen.eecs.berkeley.edu Download Document from Source Website File Size: 2,23 MB Share Document on Facebook

	Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l DocID: 1vid6 - View Document
	Introduction Network similarity problem Results Acknowledgements Spectra of the Spike Flow Graphs of Recurrent DocID: 1veQT - View Document
	An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network Linear Equations Yang Liu, Christian Lageman, Brian D. O. Anderson, and Guodong Shi∗ arXiv:1701.03908v1 [cs.SY] 14 Jan 2017 DocID: 1uJ5N - View Document
	Pipe Network Hand-in Assignment 1 Flow in Water Pipe Network DocID: 1uInK - View Document
	Inductive Intrusion Detection in Flow-Based Network Data using One-Class Support Vector Machines Philipp Winter DocID: 1uIen - View Document