The K shortest paths problem has been extensively studied for many years. E2cient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposedâ€¦ (More)

We consider routing problems in dynamic networks where arc travel times are both random and time dependent. The problem of nding the best route to a xed destination is formulated in terms of shortestâ€¦ (More)

In this paper, we introduce general techniques for extending classes of polynomially solvable SAT instances. We generalize the approach of Gallo and ScutellÃ , who defined the hierarchy {Î“ i }, whereâ€¦ (More)

Consider a bipartite graph; letÃ•s suppose we draw the origin nodes and the destination nodes arranged in two columns, and the edges as straight line segments. A non crossing matching is a subset ofâ€¦ (More)

The Probabilistic Satisfiability problem (PSAT) can be considered as a probabilistic counterpart of the classical SAT problem. In a PSAT instance, each clause in a CNF formula is assigned aâ€¦ (More)

In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum cardinality cut on a directed hypergraph. For the latter problem, we proposeâ€¦ (More)

Both probabilistic satisfiability (PSAT) and the check of coherence of probability assessment (CPA) can be considered as probabilistic counterparts of the classical propositional satisfiabilityâ€¦ (More)