✦ LIBER ✦

Time depending shortest-path problems with applications to railway networks

✍ Scribed by K. Nachtigall

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 761 KB
Volume: 83
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)e0349-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the -shortest path problem with

Solving the -shortest path problem with time windows in a time varying network

✍ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const

An exact algorithm for the elementary sh

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

✍ Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Solution of ordinary differential equati

Solution of ordinary differential equations with time dependent coefficients. Development of a semiexplicit Runge Kutta algorithm and application to a spectroscopic problem

✍ Kjeld Schaumburg; Jerzy Wasniewski; Zahari Zlatev 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 672 KB