sxlxc/edge_conn_interdiction
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

...

Browse Source
This commit is contained in:
Yu Cong 2025-04-19 14:26:12 +08:00
parent 951cc64d7b
commit 46771bae89
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
main.pdf
View File

Binary file not shown.

6
main.tex
View File

@ -131,7 +131,7 @@ How to derive normalized min cut for connectivity interdiction?
\begin{aligned}
\max& & z& & & \\
s.t.& & \sum_{e} y_e c(e) &\leq B & &\text{(budget for $F$)}\\
& & \sum_{e\in T} x_e&\geq 1 & &\forall T\quad \text{($x$ forms a cut)}\\
& & \sum_{e\in T} x_e&\geq 1 & &\forall T\quad \text{($x$ is a cut)}\\
& & \sum_{e} \min(0,x_e-y_e) w(e)&\geq z & &\\
& & y_e,x_e&\in\{0,1\} & &\forall e
\end{aligned}
@ -143,7 +143,7 @@ we can assume that $y_e\leq x_e$.
\begin{aligned}
\min& & \sum_{e} (x_e&-y_e) w(e) & & \\
% s.t.& & \sum_{e} (x_e-y_e) w(e)&\geq z & &\\
s.t.& & \sum_{e\in T} x_e&\geq 1 & &\forall T\quad \text{($x$ forms a cut)}\\
s.t.& & \sum_{e\in T} x_e&\geq 1 & &\forall T\quad \text{($x$ is a cut)}\\
& & \sum_{e} y_e c(e) &\leq B & &\text{(budget for $F$)}\\
& & x_e&\geq y_e & &\forall e\quad(F\subset C)\\
& & y_e,x_e&\in\{0,1\} & &\forall e
@ -157,7 +157,7 @@ A further reformulation (the new $x$ is $x-y$) gives us the following,
\begin{equation*}
\begin{aligned}
\min& & \sum_{e} x_e w(e) & & \\
s.t.& & \sum_{e\in T} x_e+y_e&\geq 1 & &\forall T\quad \text{($x$ forms a cut)}\\
s.t.& & \sum_{e\in T} x_e+y_e&\geq 1 & &\forall T\quad \text{($x+y$ is a cut)}\\
& & \sum_{e} y_e c(e) &\leq B & &\text{(budget for $F$)}\\
% & & x_e&\geq y_e & &\forall e\quad(F\subset C)\\
& & y_e,x_e&\in\{0,1\} & &\forall e