A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

project planning is part of project management, which is relates to the use of schedules such as gantt charts to plan and subsequently report progress within the project environment. initially, the project scope is defined and the appropriate methods for completing the project are determined. in this paper a new approach for the critical path analyzing a project network with random fuzzy activi...

in this paper the problem of 3d scene and object classification from depth data is addressed. in contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. in order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. exploiting the algorithmic information theory, a new def...

Definition The traveling salesman problem (TSP) is the following optimization problem. Given a complete graph G with edge costs, find a Hamiltonian cycle of minimum cost in G. Definition The metric traveling salesman problem (∆-TSP) is the TSP restricted to instances satisfying the triangle inequality Definition The traveling salesman problem (TSP) is the following optimization problem. Given a...