Yan Huang Favyen Bastani University of North Texas / Computer Science Shanghai Key Laboratory / e.g. airport / /
IndustryTerm
given server / energy problems / copyN odes algorithm / social network trust building systems / road network / branch-and-bound algorithms / slack-time algorithm / mixed-integer programing algorithms / insertion algorithm / shortest path algorithm / large scale real-time ridesharing / road networks / tree algorithms / mixed-integer programming algorithm / batch processing / test tree algorithms / taxi services / travel distance / communication technologies / actual travel distance / integer programing algorithm / courier services / real-time ridesharing problem / candidate server / branch-and-bound algorithm / Possible solutions / brute-force algorithms / distance computation algorithms / wireless networks / minibus services / energy / elevator systems / slack-time tree algorithm / hotspot algorithm / branch-andbound algorithm / insertNodes algorithm / basic and slack-time tree algorithms / kinetic tree algorithms / real-time matching algorithm / state-of-art hublabeling algorithm / hotspot clustering algorithm / mixed-integer programming algorithms / real-time ride sharing / mobile-phone applications / approximate solution / basic tree algorithm / Real-time ridesharing / compare kinetic tree algorithm / slack time algorithm / matching algorithms / travel times / social networks / tree algorithm / brute-force algorithm / low cost geo-locating devices / search space / modified branch-and-bound algorithm / large road networks / /
Organization
National Institute of Health / Kent State University School of Computer Science Shanghai Key Laboratory / National Science Foundation / Ohio Supercomputer Center / VLDB Endowment / Fudan University / University of North Texas Massachusetts Institute of Technology / /
Person
Sean Wang / Yan Huang Favyen / /
Position
driver / representative / /
ProgrammingLanguage
C++ / /
Region
North Texas / /
Technology
three algorithms / mixed-integer programming algorithm / basic tree algorithm / labeling algorithm / 6.2 Comparing Tree Algorithms / compare kinetic tree algorithm / 6.1 Four Algorithm / peer-to-peer / shortest path algorithm / hotspot algorithm / following hotspot clustering algorithm / modified branch-and-bound algorithm / real-time matching algorithm / proposed algorithms / slack-time tree algorithm / scheduling algorithm / brute-force algorithms / two scheduling algorithms / Bound Algorithm The branch-and-bound algorithm / mixed-integer programing algorithms / branch-and-bound algorithm / slack time algorithm / integer programing algorithm / copyN odes algorithm / two algorithms / Four algorithm / mixed-integer programming algorithms / test tree algorithms / communication technologies / tree algorithms / 1 insertNodes algorithm / hotspot-based algorithm / brute-force algorithm / kinetic tree algorithms / smartphones / basic and slack-time tree algorithms / hotspot clustering algorithm / same insertion algorithm / distance computation algorithms / simulation / tree algorithm / slack-time algorithm / branch-and-bound algorithms / state-of-art hublabeling algorithm / insertion algorithm / branch-andbound algorithm / /
Large Scale Real-time Ridesharing with Service Guarantee on Road Networks ∗ Yan Huang Favyen Bastani