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

From himtp
Jump to: navigation, search
Line 10: Line 10:
 
<math>
 
<math>
 
d(a,b)=\sum_{i} \left|a_i-b_i\right|
 
d(a,b)=\sum_{i} \left|a_i-b_i\right|
 +
</math>
 +
 +
: <math>d\colon X\times X\to\mathbb R</math>
 +
: <math>
 +
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}
 
</math>
 
</math>

Revision as of 14:53, 21 September 2015

(suggested by Jens Vygen)

Problem Statement

Let  \sqrt{f(G)} be a directed acyclic graph.... to be written

State of the Art


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}