|
|
Publications in Math-Net.Ru |
Citations |
|
2000 |
1. |
I. I. Melamed, I. Kh. Sigal, “Numerical analysis of algorithms for solving bicriteria discrete programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 40:11 (2000), 1602–1610 ; Comput. Math. Math. Phys., 40:11 (2000), 1537–1545 |
1
|
|
1999 |
2. |
I. I. Melamed, I. Kh. Sigal, N. Yu. Vladimirova, “Study of the linear parametrization of criteria in the bicriteria knapsack problem”, Zh. Vychisl. Mat. Mat. Fiz., 39:5 (1999), 753–758 ; Comput. Math. Math. Phys., 39:5 (1999), 721–726 |
5
|
|
1998 |
3. |
I. I. Melamed, I. Kh. Sigal, “Numerical analysis of tricriteria tree and assignment problems”, Zh. Vychisl. Mat. Mat. Fiz., 38:10 (1998), 1780–1787 ; Comput. Math. Math. Phys., 38:10 (1998), 1707–1714 |
5
|
|
1997 |
4. |
I. I. Melamed, I. Kh. Sigal, “Analysis of Branch-and-Bound Parameters of Solutions in the Symmetric Traveling Salesman Problem”, Avtomat. i Telemekh., 1997, no. 10, 186–192 ; Autom. Remote Control, 58:10 (1997), 1706–1711 |
1
|
5. |
I. I. Melamed, “Linear Convolution of Criteria in Multi-Criteria Optimization”, Avtomat. i Telemekh., 1997, no. 9, 119–125 ; Autom. Remote Control, 58:9 (1997), 1499–1504 |
1
|
6. |
I. I. Melamed, I. Kh. Sigal, “The linear convolution of criteria in the bicriteria traveling salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 37:8 (1997), 933–936 ; Comput. Math. Math. Phys., 37:8 (1997), 902–905 |
8
|
|
1996 |
7. |
I. I. Melamed, “The theory of linear parametrization of criteria in multicriterial
optimization”, Dokl. Akad. Nauk, 348:4 (1996), 446–448 |
1
|
8. |
I. I. Melamed, I. Kh. Sigal, “A computational investigation of linear parametrization of criteria in multicriteria discrete programming”, Zh. Vychisl. Mat. Mat. Fiz., 36:10 (1996), 23–25 ; Comput. Math. Math. Phys., 36:10 (1996), 1341–1343 |
7
|
|
1995 |
9. |
I. I. Melamed, I. Kh. Sigal, “Computational stability of a linear convolution of criteria in
multicriterial discrete programming”, Dokl. Akad. Nauk, 345:4 (1995), 463–466 |
5
|
10. |
I. I. Melamed, I. Kh. Sigal, “Investigation of a linear convolution of criteria in multicriterial discrete programming”, Zh. Vychisl. Mat. Mat. Fiz., 35:8 (1995), 1260–1270 ; Comput. Math. Math. Phys., 35:8 (1995), 1009–1017 |
13
|
|
1994 |
11. |
I. I. Melamed, “Neural networks and combinatorial optimization”, Avtomat. i Telemekh., 1994, no. 11, 3–40 ; Autom. Remote Control, 55:11 (1994), 1553–1584 |
6
|
|
1989 |
12. |
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Approximate algorithms”, Avtomat. i Telemekh., 1989, no. 11, 3–26 ; Autom. Remote Control, 50:11 (1989), 1459–1479 |
66
|
13. |
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman's problem. Exact methods”, Avtomat. i Telemekh., 1989, no. 10, 3–29 ; Autom. Remote Control, 50:10 (1989), 1303–1324 |
67
|
14. |
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Issues in theory”, Avtomat. i Telemekh., 1989, no. 9, 3–33 ; Autom. Remote Control, 50:9 (1989), 1147–1173 |
77
|
|
1987 |
15. |
S. Y. Lovetskiy, I. I. Melamed, “Dinamic flows in networks”, Avtomat. i Telemekh., 1987, no. 11, 7–29 |
16. |
S. Y. Lovetskiy, I. I. Melamed, “Static flows in networks”, Avtomat. i Telemekh., 1987, no. 10, 3–29 |
5
|
|
1980 |
17. |
V. V. Borodin, S. Y. Lovetskiy, I. I. Melamed, Yu. M. Plotinskii, “Experimental effectiveness study of heuristic algorithms for solution of the traveling salesman problem”, Avtomat. i Telemekh., 1980, no. 11, 76–84 ; Autom. Remote Control, 41:11 (1981), 1543–1550 |
1
|
|
1979 |
18. |
I. I. Melamed, Yu. M. Plotinskii, “Heuristic algorithms for solution of a generalized delivery problem”, Avtomat. i Telemekh., 1979, no. 12, 167–172 ; Autom. Remote Control, 40:12 (1980), 1845–1849 |
5
|
|
Organisations |
|
|
|
|