RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Melamed, I I

Statistics Math-Net.Ru
Total publications: 18
Scientific articles: 18

Number of views:
This page:386
Abstract pages:6758
Full texts:2590
References:172
Candidate of technical sciences

http://www.mathnet.ru/eng/person64510
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/250813

Publications in Math-Net.Ru
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 40:11 (2000), 1537–1545
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 39:5 (1999), 721–726
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 38:10 (1998), 1707–1714
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, 10,  186–192  mathnet  mathscinet  zmath; Autom. Remote Control, 58:10 (1997), 1706–1711
5. I. I. Melamed, “Linear Convolution of Criteria in Multi-Criteria Optimization”, Avtomat. i Telemekh., 1997, 9,  119–125  mathnet  mathscinet  zmath; Autom. Remote Control, 58:9 (1997), 1499–1504
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 37:8 (1997), 902–905
1996
7. I. I. Melamed, “The theory of linear parametrization of criteria in multicriterial optimization”, Dokl. Akad. Nauk, 348:4 (1996),  446–448  mathnet  mathscinet  zmath
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 36:10 (1996), 1341–1343  isi
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  mathnet  mathscinet  zmath
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 35:8 (1995), 1009–1017  isi
1994
11. I. I. Melamed, “Neural networks and combinatorial optimization”, Avtomat. i Telemekh., 1994, 11,  3–40  mathnet  mathscinet  zmath; Autom. Remote Control, 55:11 (1994), 1553–1584
1989
12. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Approximate algorithms”, Avtomat. i Telemekh., 1989, 11,  3–26  mathnet  mathscinet  zmath; Autom. Remote Control, 50:11 (1989), 1459–1479
13. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman's problem. Exact methods”, Avtomat. i Telemekh., 1989, 10,  3–29  mathnet  mathscinet  zmath; Autom. Remote Control, 50:10 (1989), 1303–1324
14. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Issues in theory”, Avtomat. i Telemekh., 1989, 9,  3–33  mathnet  mathscinet  zmath; Autom. Remote Control, 50:9 (1989), 1147–1173
1987
15. S. Y. Lovetskiy, I. I. Melamed, “Dinamic flows in networks”, Avtomat. i Telemekh., 1987, 11,  7–29  mathnet
16. S. Y. Lovetskiy, I. I. Melamed, “Static flows in networks”, Avtomat. i Telemekh., 1987, 10,  3–29  mathnet
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, 11,  76–84  mathnet  zmath; Autom. Remote Control, 41:11 (1981), 1543–1550
1979
18. I. I. Melamed, Yu. M. Plotinskii, “Heuristic algorithms for solution of a generalized delivery problem”, Avtomat. i Telemekh., 1979, 12,  167–172  mathnet  zmath; Autom. Remote Control, 40:12 (1980), 1845–1849

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020