One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...

We will consider one-terminal network design problems of the sort of Section A2.1 in Garey and Johnson's book [2]. We will explore the borderline between easy and hard problems of this kind (from the computational complexity point of view). A related problem is the capacitated spanning tree problem (denoted ND5 in [2]). Another related paper is [3] where a linear programming line of attack is a...

In the early 1970s, by work of Klee and Minty (1972) and Zadeh (1973), the Simplex Method, the Network Simplex Method, and the Successive Shortest Path Algorithm have been proved guilty of exponential worst-case behavior (for certain pivot rules). Since then, the common perception is that these algorithms can be fooled into investing senseless effort by ‘bad instances’ such as, e. g., Klee-Mint...

Minimization of decision trees is a well studied problem. In this work, we introduce two new problems related to minimization of decision trees. The problems are called minimum verification set (MinVS) and minimum path decision tree (MinPathDT) problems. Decision tree problems ask the question “What is the unknown given object?”. MinVS problem on the other hand asks the question “Is the unknown...

We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K-shortest paths finding algorithm that may be efficient in many real cases. An applicati...

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns succes...

Symbolic computation techniques play a fundamental role in these days logic synthesis and formal hardware veriication algorithms. Recently, Algebraic Decision Diagrams, i.e., BDD's with a set of constant values diierent than the set f0; 1g, have been used to solve general purpose problems, such as matrix multiplication, shortest path calculation, and solution of linear systems, as well as logic...