Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities
This paper deals in a preliminary way with the problem of selecting the smallest possible number of dominant paths in a minimized project-network with given bounds on the permissible values of the durations of activities. For this purpose, a classification technique is proposed. This technique is ba...
Main Author: | Dmitri Viattchenin |
---|---|
Format: | Article |
Language: | English |
Published: |
Wrocław University of Science and Technology
2015-01-01
|
Series: | Operations Research and Decisions |
Online Access: | http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1189 |
Similar Items
-
Heuristic possibilistic clustering for detecting optimal number of elements in fuzzy clusters
by: Viattchenin Dmitri A.
Published: (2016-03-01) -
Finding minimal branchings with a given number of arcs
by: Cvetković Dragoš M., et al.
Published: (2002-01-01) -
Neural Networks for Estimating Duration of Projects with Multiple Paths
by: Yun-Da Chuang, et al.
Published: (2009) -
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
by: Shimizu Masaaki, et al.
Published: (2011-12-01) -
Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges
by: Shaohui Wang, et al.
Published: (2018-10-01)