I. Kh. Sigal

Available identifiers

zbMath Open sigal.i-khWikidataQ4418558 ScholiaQ4418558MaRDI QIDQ179140

List of research outcomes

Publication	Date of Publication	Type
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method	2024-03-04	Paper
Speedup estimates for some variants of the parallel implementations of the branch-and-bound method	2024-03-01	Paper
Accounting for the time characteristics of a class of scheduling problems for moving processor	2016-03-08	Paper
Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions	2013-07-30	Paper
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method	2011-01-03	Paper
Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation	2010-09-24	Paper
A combined parallel algorithm for solving the knapsack problem	2009-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q3596895	2009-02-09	Paper
Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems	2007-10-30	Paper
Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms	2007-10-22	Paper
Estimates of the deviation of approximate solutions from an optimal solution in certain problems of discrete optimization	2007-05-16	Paper
Bicriterial problem of decomposition of a production system	2005-10-11	Paper
Parametrization and investigation of some large-scale discrete programming problems	2005-10-10	Paper
Numerical analysis of tricriteria tree and assignment problems	2004-02-18	Paper
Investigation of a linear convolution of criteria in multicriterial discrete programming	2003-12-10	Paper
Numerical analysis of algorithms for solving bicriteria discrete programming problems	2002-11-23	Paper
Study of the linear parametrization of criteria in the bicriteria knapsack problem	2001-06-19	Paper
Combinatorial optimization problems with two and three criteria	2001-01-28	Paper
The linear convolution of criteria in the bicriteria traveling salesman problem	2000-04-05	Paper
A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem	1999-06-29	Paper
A computational investigation of linear parametrization of criteria in multicriteria discrete programming	1999-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4391175	1998-05-26	Paper
Computational study of a linear convolution of criteria in discrete multicriteria programming	1998-02-05	Paper
Algorithms for solving the two-criterion large-scale travelling salesman problem	1995-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4006772	1992-09-26	Paper
The traveling salesman problem. Approximate algorithms	1989-01-01	Paper
The traveling salesman problem. I: Theoretical issues	1989-01-01	Paper
The traveling salesman problem. II: Exact methods	1989-01-01	Paper
A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem	1989-01-01	Paper
An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3802876	1987-01-01	Paper
An algorithm for solving large-scale travelling-salesman problems and its numerical implementation	1987-01-01	Paper
Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3789368	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3743141	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3328278	1983-01-01	Paper
Computational algorithms for finding the radius of stability in problems of choice	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4147873	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4404660	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4173392	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5641009	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5607024	1970-01-01	Paper
A method of matrix analysis and its application to a problem in the theory of graphs	1967-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5561621	1966-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: I. Kh. Sigal