This paper presented a new algorithm that is capable of solving network flow problem with convex separable costs.

 
  • 為求解非線(xiàn)性可分凸費用網(wǎng)絡(luò )流問(wèn)題,提出了一種原始對偶算法,并證明了算法的收斂性。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan