论文信息 - Porównanie działania wybranych algorytmów rozwiązywania nieliniowych zadań alokacji - 字舞流文

Porównanie działania wybranych algorytmów rozwiązywania nieliniowych zadań alokacji

Marcin Anholcer

[1] Peter Värbrand,et al. Strongly polynomial algorithm for two special minimum concave cost network flow problems , 1995 .

[2] Dimitri P. Bertsekas,et al. Parallel primal-dual methods for the minimum cost flow problem , 1993, Comput. Optim. Appl..

[3] Peter Värbrand,et al. A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables , 1996, Math. Program..

[4] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .

[5] Uwe T. Zimmermann,et al. A combinatorial interior point method for network flow problems , 1992, Math. Program..

[6] Ron Shamir,et al. A polynomial algorithm for an integer quadratic non-separable transportation problem , 1992, Math. Program..

[7] Kaj Holmberg,et al. A production-transportation problem with stochastic demand and concave production costs , 1999, Math. Program..

[8] Dimitri P. Bertsekas,et al. Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[9] Richard M. Soland,et al. Optimal Facility Location with Concave Costs , 1974, Oper. Res..