✦ LIBER ✦

An algorithm for finding reasonable paths in transit networks

✍ Scribed by Man-chun Tan; C. O. Tong; S. C. Wong; Jian-min Xu

Publisher: Institute for Transportation Inc.
Year: 2007
Tongue: English
Weight: 299 KB
Volume: 41
Category: Article
ISSN: 0197-6729
DOI: 10.1002/atr.5670410305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial-Time Algorithm for Finding

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

✍ Zhivko P. Nedev; Peter T. Wood 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Algorithm for finding an interpretable s

Algorithm for finding an interpretable simple neural network solution using PLS

✍ Rasmus Bro 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 434 KB

An adaptive survivability admission cont

An adaptive survivability admission control algorithm using backup path for high-speed networks

✍ Chi-Chun Lo; Bin-Wen Chuang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

Algorithms for minimum-cost paths in tim

Algorithms for minimum-cost paths in time-dependent networks with waiting policies

✍ Brian C. Dean 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

Decomposition algorithms for finding the

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB