Abstract: In this paper,we discussed the multi constrained path(MCP)finding problem.The contributions of this paper lie in illustrating and classifying the MCP problem normatively.And for each kind of problem,it discusses typical algorithms.At the same time,the algorithms are extended to be more appropriate in solving MCP problem in the areas of management sciences.

Key words: multi-constraints, shortest path finding algorithms, NP-Complete, heuristic algorithms