مشخصات پژوهش

عنوان	Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths
نوع پژوهش	مقاله چاپ‌شده در مجلات علمی
کلیدواژه‌ها	The quickest path problem
چکیده	The quickest path problem consists of finding a path in a directed network to transmit a given amount σ of items from a source node to a sink node with minimal transmission time, where the transmission time depends on the traversal times τ and the capacities u of the arcs. We suppose that there exist more than one quickest path and finds a quickest path with a special property...
پژوهشگران	مهدی قیاسوند (نفر اول)، اعظم رمضانی پورشهربابک (نفر دوم)