What does “lower bound” mean in circulation problems?

Question . Circulation problems make it possible to have both a lower and an upper boundary of the flow through a certain arc. The upper bound I understand (like pipes, there are only so many things that can go through). However, it’s hard for me to understand the idea of ​​a lower bound. What does it mean? Will there be an algorithm to solve the problem ...

  • try to make sure that each arc with a lower boundary will receive at least such a stream, will not work completely if it cannot find a way?
  • just ignore the arc if the lower bound cannot be satisfied? This will make more sense to me, but it will mean that there can be arcs with stream 0 in the resulting graph, i.e.lower ≤ f ≤ upper vf = 0

Context . I am trying to find a way to quickly plan a set of events, each of which has a length and a set of possible times for which they can be scheduled. I am trying to reduce this problem to a circulation problem for which efficient algorithms exist.

I put each event in a directed graph as a node and put it with the number of time intervals that it should fill. Then I add all possible moments as nodes, and finally, all time intervals like this (all arcs are on the right):

 

My graph

 

The first two events have one possible time and length 1, and the last event has a length of 4 and two possible times.

Does this schedule make sense? In particular, will the number of time intervals that are filled be 2 (only “light”) or six, for example, in the picture?

( push-relabel LEMON, .)

+5
2

:

@Helen; , . , , .

= 0 ( @KillianDS). , , " ": enter image description here

, ( , ) ,

  • ( ).

- ( , X , @Helen). , , ( ).

:

, , ( ).

, :

E1 - {9:10}
E2 - {9:00}
E3 - {9:20, 9:30, 9:40, 9:50}
E3 - {9:00, 9:10, 9:20, 9:30}

, (.. , , "on") s.t. (.. ).

, NP-Hard, , , (.. ). , / .

, . E1 "" E3 E2 E3. E1 ( ), E3 ( ). E3, E2 . , ( , ) .

, ( "" ), ( 4 , , 3). , . ( , ), , , .

, , ( ), , . .

: , . , ( , , , ). , ILP , , .

, .

+4

. , . .

. , 0 , , . . LEMON , . 0 n, n - , , "" .

"",  lower ≤ f ≤ upper vf = 0

f >= y * lower
f <= y * upper

y 0 1. y 0, f 0. y 1, f . , , .

+1

All Articles