I. Sigal

发表

Study of the linear parametrization of criteria in the bicriteria Knapsack problem

I. Melamed, I. Sigal, N. Vladimirova, 1999 .

Algorithms for solving the two-criterion large-scale travelling salesman problem

I. Sigal, 1994 .

COMBINATORIAL OPTIMIZATION PROBLEMS WITH TWO AND THREE CRITERIA

I. Melamed, I. Sigal, 1999 .

An investigation of linear convolution of criteria in multicriteria discrete programming

I. Melamed, I. Sigal, 1995 .

A computational investigation of linear parametricization of criteria in multicriteria discrete programming

I. Melamed, I. Sigal, 1996 .

Numerical analysis of tricriteria tree and assignment problems

I. Melamed, I. Sigal, 1998 .

The linear convolution of criteria in the bicriteria traveling salesman problem

I. Melamed, I. Sigal, 1997 .

Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions

I. Sigal, A. Korbut, 2010 .

Computational algorithms for finding the radius of stability in problems of choice

V. K. Leont'ev, E. N. Gordeev, I. Sigal, 1983 .

An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

I. Sigal, 1990 .

Knapsack problems : Linear relaxations and greedy algorithms

I. Sigal, A. Korbut, 2011 .

Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation

I. Sigal, A. Korbut, N. N. Galim’yanova, 2009 .

Minimal-cost flow in certain linear-programming problems

I. Kh. Sigal, Yu. Yu. Finkel'shtein, I. Sigal, 1974 .

A framework for parallel large-scale global optimization

Mikhail Posypkin, Yuri Evtushenko, Israel Sigal, 2009, Computer Science - Research and Development.