Network Flow with constraint of equal flows on given list of edges.

Правка en3, от Tokyo_Drift, 2022-12-18 10:48:47

I have some network $$$G$$$, and for $$$k$$$ edges $$$e_1$$$, $$$e_2$$$... $$$e_k$$$, there is constraint that flow on these edges should be always equal to each other: $$$f_{e_1}=f_{e_2} = ...f_{e_k}$$$. Given this constraint I want to find max flow on $$$G$$$. $$$G$$$ is network with around 10k edges and I have around 1-5 minutes time limit. Any ideas, papers, problems?

Теги flow, graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Tokyo_Drift 2022-12-18 10:48:47 49 Tiny change: '{e_2} = ..f_{e_k}$' -> '{e_2} = ...f_{e_k}$'
en2 Английский Tokyo_Drift 2022-12-18 10:41:18 231 Tiny change: 'for edges e_1, e_2 and e_n, there is' -> 'for edges $e_1$, $e_2$ and $e_n$, there is' (published)
en1 Английский Tokyo_Drift 2022-12-18 10:36:00 235 Initial revision (saved to drafts)