Quickest Flows Over Time

@misc{rc03-fleischer-quickest, abstract = {Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the...}, author = {Fleischer, Lisa and Skutella, Martin }, citeulike-article-id = {530917}, keywords = {flow, quickest}, posted-at = {2006-03-04 19:33:37}, priority = {5}, title = {Quickest Flows Over Time}, url = {http://citeseer.ist.psu.edu/689855.html} }

TY - GEN ID - rc03-fleischer-quickest L3 - citeulike-article-id:530917 TI - Quickest Flows Over Time N2 - Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the... KW - flow KW - quickest AU - Fleischer, Lisa AU - Skutella, Martin UR - http://citeseer.ist.psu.edu/689855.html ER -