We study the following sequential assignment problem on a finite graph G = (V ,E). Each edge e ∈ E starts with an integer value n e ≥ 0, and we write n =∑ e∈En e. At time t, 1 ≤ t ≤ n, a...
We study the following sequential assignment problem on a finite graph G = (V ,E). Each edge e ∈ E starts with an integer value n e ≥ 0, and we write n =∑ e∈En e. At time t, 1 ≤ t ≤ n, a...
|< |
< |
1 |