scientific article; zbMATH DE number 1517143
From MaRDI portal
Publication:4509382
DOI<47::AID-NET5>3.0.CO;2-Q 10.1002/1097-0037(200008)36:1<47::AID-NET5>3.0.CO;2-QzbMath0969.90017MaRDI QIDQ4509382
David J. Michael, Jerzy Kamburowski, Matthias F. M. Stallmann
Publication date: 7 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic network models in operations research (90B10) Complexity and performance of numerical algorithms (65Y20)
Related Items (6)
A new method for constructing a minimal PERT network ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ A path enumeration approach for the analysis of critical activities in fuzzy networks ⋮ On the latest starting times and criticality of activities in a network with imprecise durations ⋮ Simplifying activity networks under generalized precedence relations to extended CPM networks
This page was built for publication:
