The following pages link to I. Kh. Sigal (Q179140):
Displaying 44 items.
- Accounting for the time characteristics of a class of scheduling problems for moving processor (Q254130) (← links)
- Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions (Q357176) (← links)
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225) (← links)
- A combined parallel algorithm for solving the knapsack problem (Q734010) (← links)
- Estimates of the deviation of approximate solutions from an optimal solution in certain problems of discrete optimization (Q880806) (← links)
- The traveling salesman problem. Approximate algorithms (Q917453) (← links)
- The traveling salesman problem. I: Theoretical issues (Q918426) (← links)
- The traveling salesman problem. II: Exact methods (Q918427) (← links)
- A computational investigation of linear parametrization of criteria in multicriteria discrete programming (Q1264669) (← links)
- A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (Q1281074) (← links)
- Computational study of a linear convolution of criteria in discrete multicriteria programming (Q1374962) (← links)
- Investigation of a linear convolution of criteria in multicriterial discrete programming (Q1416003) (← links)
- Numerical analysis of tricriteria tree and assignment problems (Q1571283) (← links)
- Combinatorial optimization problems with two and three criteria (Q1594396) (← links)
- Numerical analysis of algorithms for solving bicriteria discrete programming problems (Q1608267) (← links)
- Algorithms for solving the two-criterion large-scale travelling salesman problem (Q1842309) (← links)
- Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation (Q1956930) (← links)
- The linear convolution of criteria in the bicriteria traveling salesman problem (Q1975097) (← links)
- Large-scale discrete programming problems: parametrization and analysis of \(\varepsilon\)-approximate algorithms (Q2455122) (← links)
- Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems (Q2457112) (← links)
- Bicriterial problem of decomposition of a production system (Q2567625) (← links)
- Parametrization and investigation of some large-scale discrete programming problems (Q2568150) (← links)
- (Q3328278) (← links)
- (Q3596895) (← links)
- Computational algorithms for finding the radius of stability in problems of choice (Q3682231) (← links)
- (Q3743141) (← links)
- Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem (Q3758578) (← links)
- (Q3789368) (← links)
- (Q3802876) (← links)
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation (Q3815887) (← links)
- (Q4006772) (← links)
- (Q4147873) (← links)
- (Q4173392) (← links)
- (Q4391175) (← links)
- (Q4404660) (← links)
- An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane (Q4735050) (← links)
- (Q5561621) (← links)
- (Q5607024) (← links)
- A method of matrix analysis and its application to a problem in the theory of graphs (Q5608521) (← links)
- (Q5641009) (← links)
- A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem (Q5752306) (← links)
- Study of the linear parametrization of criteria in the bicriteria knapsack problem (Q5932933) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659) (← links)
