Difference between revisions of "Discrete Time-Cost Tradeoff Problem"

Let $\sqrt{f(G)}$ be a directed acyclic graph.... to be written
$d(a,b)=\sum_{i} \left|a_i-b_i\right|$
$d\colon X\times X\to\mathbb R$
$d(A,B)=\begin{cases} \|A-B\|&\text{falls } A, B \text{ auf einer Geraden durch } P \text{ liegen, }\\ \|A-P\|+\|P-B\|&\text{sonst}. \end{cases}$