I. Kh. Sigal

From MaRDI portal
Person:179140

Available identifiers

zbMath Open sigal.i-khWikidataQ4418558 ScholiaQ4418558MaRDI QIDQ179140

List of research outcomes





PublicationDate of PublicationType
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method2024-03-04Paper
Speedup estimates for some variants of the parallel implementations of the branch-and-bound method2024-03-01Paper
Accounting for the time characteristics of a class of scheduling problems for moving processor2016-03-08Paper
Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions2013-07-30Paper
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method2011-01-03Paper
Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation2010-09-24Paper
A combined parallel algorithm for solving the knapsack problem2009-10-19Paper
https://portal.mardi4nfdi.de/entity/Q35968952009-02-09Paper
Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems2007-10-30Paper
Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms2007-10-22Paper
Estimates of the deviation of approximate solutions from an optimal solution in certain problems of discrete optimization2007-05-16Paper
Bicriterial problem of decomposition of a production system2005-10-11Paper
Parametrization and investigation of some large-scale discrete programming problems2005-10-10Paper
Numerical analysis of tricriteria tree and assignment problems2004-02-18Paper
Investigation of a linear convolution of criteria in multicriterial discrete programming2003-12-10Paper
Numerical analysis of algorithms for solving bicriteria discrete programming problems2002-11-23Paper
Study of the linear parametrization of criteria in the bicriteria knapsack problem2001-06-19Paper
Combinatorial optimization problems with two and three criteria2001-01-28Paper
The linear convolution of criteria in the bicriteria traveling salesman problem2000-04-05Paper
A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem1999-06-29Paper
A computational investigation of linear parametrization of criteria in multicriteria discrete programming1999-03-07Paper
https://portal.mardi4nfdi.de/entity/Q43911751998-05-26Paper
Computational study of a linear convolution of criteria in discrete multicriteria programming1998-02-05Paper
Algorithms for solving the two-criterion large-scale travelling salesman problem1995-05-15Paper
https://portal.mardi4nfdi.de/entity/Q40067721992-09-26Paper
The traveling salesman problem. I: Theoretical issues1989-01-01Paper
The traveling salesman problem. II: Exact methods1989-01-01Paper
The traveling salesman problem. Approximate algorithms1989-01-01Paper
A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem1989-01-01Paper
An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane1988-01-01Paper
An algorithm for solving large-scale travelling-salesman problems and its numerical implementation1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38028761987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37893681986-01-01Paper
Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37431411985-01-01Paper
Computational algorithms for finding the radius of stability in problems of choice1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282781983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41478731977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44046601974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41733921973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56410091972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56070241970-01-01Paper
A method of matrix analysis and its application to a problem in the theory of graphs1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55616211966-01-01Paper

Research outcomes over time

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