Network Optimization Models The problem is then formulated as the following integer program: n m Min 含+月 subject to 头= for j=1,...,m m ≤K》for y%∈{0,1} fori=1,,n,x≥0 SCM by J.J.Gao SEIEE AU406 11SEIEE AU406 + - 11 Network Optimization Models SCM by J. J. Gao