✦ LIBER ✦

Shortest path under rational constraint

✍ Scribed by Jean-François Romeuf

Book ID: 113163310
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 492 KB
Volume: 28
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90198-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time-varying shortest path problems with

Time-varying shortest path problems with constraints

✍ Cai, X.; Kloks, T.; Wong, C. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

We study a new version of the shortest path problem. Let G Å (V, E) be a directed graph. Each arc e √ E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.

Soft Constraint Logic Programming and Ge

Soft Constraint Logic Programming and Generalized Shortest Path Problems

✍ Stefano Bistarelli; Ugo Montanari; Francesca Rossi 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 115 KB

Trinocular Stereo Using Shortest Paths a

Trinocular Stereo Using Shortest Paths and the Ordering Constraint

✍ Motilal Agrawal; Larry S. Davis 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 562 KB

Shortest paths in simple polygons with p

Shortest paths in simple polygons with polygon-meet constraints

✍ Ramtin Khosravi; Mohammad Ghodsi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Shortest path with time constraints on m

Shortest path with time constraints on movement and parking

✍ J. Halpern; I. Priess 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

Solving shortest path problems with a we

Solving shortest path problems with a weight constraint and replenishment arcs

✍ Olivia J. Smith; Natashia Boland; Hamish Waterer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 548 KB