𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity analysis and optimization of the shortest path tour problem

✍ Scribed by Paola Festa

Book ID
107403346
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
700 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of shortest path and dila
The complexity of shortest path and dilation bounded interval routing
✍ Rastislav KrΓ‘ΔΎovič; Peter RuΕΎička; Daniel Ε tefankovič πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 227 KB

Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology (May and Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991). Recently much e ort is devoted to relate the e ci

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