Melamed Igor' Il'ich

Publications in Math-Net.Ru

1. Numerical analysis of algorithms for solving bicriteria discrete programming problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 40:11 (2000),  1602–1610
2. Study of the linear parametrization of criteria in the bicriteria knapsack problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 39:5 (1999),  753–758
3. Numerical analysis of tricriteria tree and assignment problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 38:10 (1998),  1780–1787
4. Analysis of Branch-and-Bound Parameters of Solutions in the Symmetric Traveling Salesman Problem
   
   Avtomat. i Telemekh., 1997, no. 10,  186–192
5. Linear Convolution of Criteria in Multi-Criteria Optimization
   
   Avtomat. i Telemekh., 1997, no. 9,  119–125
6. The linear convolution of criteria in the bicriteria traveling salesman problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 37:8 (1997),  933–936
7. The theory of linear parametrization of criteria in multicriterial optimization
   
   Dokl. Akad. Nauk, 348:4 (1996),  446–448
8. A computational investigation of linear parametrization of criteria in multicriteria discrete programming
   
   Zh. Vychisl. Mat. Mat. Fiz., 36:10 (1996),  23–25
9. Computational stability of a linear convolution of criteria in multicriterial discrete programming
   
   Dokl. Akad. Nauk, 345:4 (1995),  463–466
10. Investigation of a linear convolution of criteria in multicriterial discrete programming
    
    Zh. Vychisl. Mat. Mat. Fiz., 35:8 (1995),  1260–1270
11. Neural networks and combinatorial optimization
    
    Avtomat. i Telemekh., 1994, no. 11,  3–40
12. The traveling salesman problem. Approximate algorithms
    
    Avtomat. i Telemekh., 1989, no. 11,  3–26
13. The traveling salesman's problem. Exact methods
    
    Avtomat. i Telemekh., 1989, no. 10,  3–29
14. The traveling salesman problem. Issues in theory
    
    Avtomat. i Telemekh., 1989, no. 9,  3–33
15. Dinamic flows in networks
    
    Avtomat. i Telemekh., 1987, no. 11,  7–29
16. Static flows in networks
    
    Avtomat. i Telemekh., 1987, no. 10,  3–29
17. Experimental effectiveness study of heuristic algorithms for solution of the traveling salesman problem
    
    Avtomat. i Telemekh., 1980, no. 11,  76–84
18. Heuristic algorithms for solution of a generalized delivery problem
    
    Avtomat. i Telemekh., 1979, no. 12,  167–172