|
|
|
|
References
|
|
| |
| 1. |
Gavrilov G. P., Sapozhenko A. A., Sbornik zadach po diskretnoi matematike, Nauka, M., 1977, 368 pp.  |
| 2. |
Grishukhin V. P., “O srednem chisle iteratsii algoritma Balasha”, Issledovaniya po diskretnoi matematike, Nauka, M., 1973, 58–68 |
| 3. |
Geri M., Dzhonson M., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982, 416 pp. |
| 4. |
Zaozërskaya L. A., Borisenko D. A., Gofman N. G., “O chisle dopustimykh reshenii zadachi ob upakovke mnozhestva”, Dinamika sistem, mekhanizmov i mashin, Materialy VII mezhdunar. nauchno-tekhnicheskoi konf., v. 3, Izdatelstvo OmGTU, Omsk., 2009, 31–35 |
| 5. |
Zaozërskaya L. A., Kolokolov A. A., “O srednem chisle iteratsii nekotorykh algoritmov dlya resheniya zadachi ob upakovke mnozhestva”, Metody optimizatsii i ikh prilozheniya, Tr. XIV Baikalskoi mezhdunar. shkoly-seminara, v. 1, ISEM SO RAN, Irkutsk, 2008, 388–395 |
| 6. |
Zaozërskaya L. A., Kolokolov A. A., “O srednem chisle iteratsii nekotorykh algoritmov dlya resheniya zadachi ob upakovke mnozhestva”, Zhurn. vychisl. matematiki i mat. fiziki, 50:2 (2010), 242–248   |
| 7. |
Kolokolov A A., “Regulyarnye razbieniya i otsecheniya v tselochislennom programmirovanii”, Sib. zhurn. issled. operatsii, 1:2 (1994), 18–39 |
| 8. |
Kolokolov A. A., Devyaterikova M. V., Zaozërskaya L. A., Regulyarnye razbieniya v tselochislennom programmirovanii, Uchebnoe posobie, Izd-vo OmGU, Omsk, 2007, 60 pp. |
| 9. |
Kuzyurin N. N., “Polinomialnyi v srednem algoritm v tselochislennom lineinom programmirovanii”, Sib. zhurn. issled. operatsii, 1:3 (1994), 38–48 |
| 10. |
Kuzyurin N. N., Fomin S. A., Effektivnye algoritmy i slozhnost vychislenii, 2008 http://discopal.ispras.ru/images/f/f4/Book-advanced-algorithms.pdf |
| 11. |
Khachiyan L. G., “Polinomialnyi algoritm v lineinom programmirovanii”, Dokl. AN SSSR, 244:5 (1979), 1093–1096 |
| 12. |
Khu T., Tselochislennoe programmirovanie i potoki v setyakh, Mir, M., 1974, 519 pp. |
| 13. |
Beier R., Vöcking B., “Probabilistic analysis of knapsack core algorithms”, Proc. 15th Annual Symp. Discrete Algorithms (SODA-2004), SIAM, New Orleans, 2004, 468–477 |
| 14. |
Brown C. A., Purdom P. W. (jr.), “An average time analysis of backtracking”, SIAM J. Comput., 10:3 (1981), 583–593   |
| 15. |
Dinh Dieu P., Cong Thang L., Tuan Hoa L., “Average polynomial time complexity of some NP-complete problems”, Theoret. Comput. Sci., 46:2 (1986), 219–237 |
| 16. |
Gurevitch Y., Shelah S., “Expected computation time for Hamiltonian path problem”, SIAM J. Comput., 16:3 (1987), 486–502 |
| 17. |
Nemhauser G. L., Wolsey L. A., Integer and combinatorial optimization, Wiley-Intersci. Publ., John Wiley and Sons, Inc., New York–Chichester–Weinheim–Brisbane–Singapore–Toronto, 1999, 763 pp. |
| 18. |
Iwama K., “CNF satisfiability test by counting and polynomial average time”, SIAM J. Comput., 18:2 (1989), 385–391 |
| 19. |
Smale S., “On the average number of steps of the simplex method of linear programming”, Math. Programming, 27:3 (1983), 241–262 |
