Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Sigal, Israel Khaimovich
(1938–2016)
Statistics Math-Net.Ru
Total publications: 24
Scientific articles: 24

Number of views:
This page:964
Abstract pages:12246
Full texts:6672
References:498
Professor
Doctor of technical sciences (1991)
Speciality: 05.13.16 (Computer techniques, mathematical modelling, and mathematical methods with an application to scientific researches)
Keywords: operations research; mathematical programming; discrete programming; integer programming; lagre-scale problems; branch and bound algorithms of discrete programming; decomposition methods; approximation methods and heuristics.

Subject:

Is developed a decomposition approach to solving a travelling salesman problem of the large-scale. The approach allows reducing solution of the large-scale problem to solving of subtasks essentially of smaller dimension and creation of solution of the initial task from solutions of subtasks. The combined algorithm of branches and bounds applied for solution of subtasks in the decomposition approach is developed. Are conducted research of the multicriteria problems of discrete programming and computing experiment on solution of the classical problems with two and three criteria. The research on parameterisation of the large-scale discrete programming problems is fulfilled.

Biography

Graduated from Faculty of Mathematics and Physics of I. I. Mechnikov Odessa State University in 1960 (department of theory of functions and difference equations). Postgraduate studies, Computer Center Russian Academy of Sciences, Moscow (1964–1967). Ph.D. thesis was defended in 1967. D.Sci. thesis was defended in 1990. A list of my works contains more than 95 titles.

Is elected in 2000 in Corresponding Member of the Russian academy Natural sciences.
   
Main publications:
  • Sigal I. Kh. Dekompozitsionnyi podkhod k resheniyu zadachi kommivoyazhera bolshoi razmernosti i nekotorye ego prilozheniya // Izvestiya AN SSSR. Tekhnicheskaya kibernetika, 1990, 6, 143–155.
  • Sigal I. Kh. Algoritmy dlya resheniya bikriterialnoi zadachi kommivoyazhera bolshoi razmernosti // ZhVM i MF, 1994, 34(1), 44–57.
  • Melamed I. I., Sigal I. Kh. Vychislitelnoe issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii // Doklady RAN, 1995, 345(4), 463–466.
  • Sigal I. Kh. Parametrizatsiya i issledovanie nekotorykh zadach diskretnogo programmirovaniya bolshoi razmernosti // Izvestiya RAN. Teoriya i sistemy upravleniya, 2001, 2, 60–69.
  • Sigal I. Kh., Ivanova A. P. Vvedenie v prikladnoe diskretnoe programmirovanie. M. Fizmatlit. 2002.

https://www.mathnet.ru/eng/person17883
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/233543

Publications in Math-Net.Ru Citations
2015
1. D. I. Kogan, I. Kh. Sigal, “Accounting for the time characteristics of a class of scheduling problems for moving processor”, Avtomat. i Telemekh., 2015, no. 12,  121–134  mathnet  elib; Autom. Remote Control, 76:12 (2015), 2190–2200  isi  scopus 2
2. Bo Tian, M. A. Posypkin, I. Kh. Sigal, “Load balancing in solving problems based on estimates of the computational complexity of subproblems”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2015, no. 1,  10–18  mathnet
2010
3. R. M. Kolpakov, M. A. Posypkin, I. Kh. Sigal, “On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method”, Avtomat. i Telemekh., 2010, no. 10,  156–166  mathnet  mathscinet  zmath; Autom. Remote Control, 71:10 (2010), 2152–2161  isi  scopus 10
2007
4. M. A. Posypkin, I. Kh. Sigal, “Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method”, Zh. Vychisl. Mat. Mat. Fiz., 47:9 (2007),  1524–1537  mathnet  mathscinet; Comput. Math. Math. Phys., 47:9 (2007), 1464–1476  scopus 2
2006
5. M. A. Posypkin, I. Kh. Sigal, “Speedup estimates for some variants of the parallel implementations of the branch-and-bound method”, Zh. Vychisl. Mat. Mat. Fiz., 46:12 (2006),  2289–2304  mathnet  mathscinet; Comput. Math. Math. Phys., 46:12 (2006), 2187–2202  scopus 8
2005
6. M. A. Posypkin, I. Kh. Sigal, “Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 45:10 (2005),  1801–1809  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 45:10 (2005), 1735–1742 8
2000
7. 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 1
1999
8. 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 5
1998
9. 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 5
1997
10. 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  mathnet  mathscinet  zmath; Autom. Remote Control, 58:10 (1997), 1706–1711 1
11. 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 8
1996
12. 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 7
1995
13. 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 5
14. 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 13
1994
15. I. Kh. Sigal, “Algorithms for solving the two-criterion large-scale travelling salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 34:1 (1994),  44–57  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 34:1 (1994), 33–43  isi 5
1989
16. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Approximate algorithms”, Avtomat. i Telemekh., 1989, no. 11,  3–26  mathnet  mathscinet  zmath; Autom. Remote Control, 50:11 (1989), 1459–1479 66
17. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman's problem. Exact methods”, Avtomat. i Telemekh., 1989, no. 10,  3–29  mathnet  mathscinet  zmath; Autom. Remote Control, 50:10 (1989), 1303–1324 67
18. I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Issues in theory”, Avtomat. i Telemekh., 1989, no. 9,  3–33  mathnet  mathscinet  zmath; Autom. Remote Control, 50:9 (1989), 1147–1173 77
19. I. Kh. Sigal, “A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 29:11 (1989),  1714–1721  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 29:6 (1989), 80–84 2
1988
20. I. Kh. Sigal, “An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane”, Zh. Vychisl. Mat. Mat. Fiz., 28:8 (1988),  1268–1272  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 28:4 (1988), 205–208 2
1987
21. I. Kh. Sigal, “An algorithm for solving large-scale travelling-salesman problems and its numerical implementation”, Zh. Vychisl. Mat. Mat. Fiz., 27:8 (1987),  1145–1153  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 27:4 (1987), 121–127 5
1986
22. I. Kh. Sigal, “Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 26:5 (1986),  664–672  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 26:3 (1986), 14–19 2
1983
23. E. N. Gordeev, V. K. Leont'ev, I. Kh. Sigal, “Computing algorithms for determination of the radius of stability in choice problems”, Zh. Vychisl. Mat. Mat. Fiz., 23:4 (1983),  973–979  mathnet  zmath; U.S.S.R. Comput. Math. Math. Phys., 23:4 (1983), 128–132 7
1965
24. I. Kh. Sigal, V. A. Chebakov, “A method of matrix analysis and its application to a problem in the theory of graphs”, Zh. Vychisl. Mat. Mat. Fiz., 5:1 (1965),  148–150  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 5:1 (1965), 213–216

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024