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.
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.
