✦ LIBER ✦

Finding disjoint paths with different path-costs: Complexity and algorithms

✍ Scribed by Chung-Lun Li; S. Thomas McCormick; David Simchi-Levi

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 642 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220705

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of finding maximum disjoi

The complexity of finding maximum disjoint paths with length constraints

✍ A. Itai; Y. Perl; Y. Shiloach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

The time-dependent shortest pair of disj

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

A new heuristic algorithm for finding mi

A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

✍ Anna Hać; Kelei Zhou 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w

Conjugate peak refinement: an algorithm

Conjugate peak refinement: an algorithm for finding reaction paths and accurate transition states in systems with many degrees of freedom

✍ Stefan Fischer; Martin Karplus 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 621 KB

An algorithm is presented for determining multi-dimensional reaction coordinates between two known conformers. Only the energy function and its gradient are required. The resulting paths follow the adiabatic energy valleys and have energy maxima that are true saddle points, which can be multiple alo