hrcak mascot   Srce   HID

Original scientific paper

AND/OR graphs and project management

Dušan Hvalica ; Faculty of Economics, Ljubljana, Slovenia

Fulltext: english, pdf (2 MB) pages 193-197 downloads: 45* cite
APA 6th Edition
Hvalica, D. (1997). AND/OR graphs and project management. Journal of computing and information technology, 5 (3), 193-197. Retrieved from https://hrcak.srce.hr/150260
MLA 8th Edition
Hvalica, Dušan. "AND/OR graphs and project management." Journal of computing and information technology, vol. 5, no. 3, 1997, pp. 193-197. https://hrcak.srce.hr/150260. Accessed 29 Sep. 2020.
Chicago 17th Edition
Hvalica, Dušan. "AND/OR graphs and project management." Journal of computing and information technology 5, no. 3 (1997): 193-197. https://hrcak.srce.hr/150260
Harvard
Hvalica, D. (1997). 'AND/OR graphs and project management', Journal of computing and information technology, 5(3), pp. 193-197. Available at: https://hrcak.srce.hr/150260 (Accessed 29 September 2020)
Vancouver
Hvalica D. AND/OR graphs and project management. Journal of computing and information technology [Internet]. 1997 [cited 2020 September 29];5(3):193-197. Available from: https://hrcak.srce.hr/150260
IEEE
D. Hvalica, "AND/OR graphs and project management", Journal of computing and information technology, vol.5, no. 3, pp. 193-197, 1997. [Online]. Available: https://hrcak.srce.hr/150260. [Accessed: 29 September 2020]

Abstracts
It is shown that projects can be described by AND/OR graphs and that the cost of the minimal solution subgraph can be defined so as to equal the shortest time for completing a project or the minimal costs of the project represented by the AND/ OR graph.

Keywords
project management; network programming; AND/OR graphs

Hrčak ID: 150260

URI
https://hrcak.srce.hr/150260

Visits: 84 *