Minimum time paths in a network with mixed time constraints.

DOI10.1016/S0305-0548(98)00020-3zbMath1040.90505OpenAlexW2067736810MaRDI QIDQ1406690

Kwei Tang, Yen-Liang Chen

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00020-3

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (25)

Reachability for airline networks: fast algorithm for shortest path problem with time windows ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ Solving the \(k\)-shortest path problem with time windows in a time varying network ⋮ Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations ⋮ Minimization of travel time and weighted number of stops in a traffic-light network

Cites Work

• A note on two problems in connexion with graphs
• A reoptimization algorithm for the shortest path problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Shortest-path algorithms: Taxonomy and annotation
• Routing with time windows by column generation
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Deterministic network optimization: A bibliography
• Shortest Route Models for the Allocation of Inspection Effort on a Production Line

This page was built for publication: Minimum time paths in a network with mixed time constraints.