The following pages link to I. I. Melamed (Q179139):
Displaying 25 items.
- 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)
- Static flows in networks (Q1100084) (← links)
- Dynamic flows in networks (Q1102851) (← links)
- On constant discrete programming problems (Q1142698) (← links)
- Heuristic algorithm for solving the generalized delivery problem (Q1143945) (← links)
- Experimental study of the efficiency of heuristic algorithms for solution of the traveling salesman problem (Q1154949) (← links)
- A computational investigation of linear parametrization of criteria in multicriteria discrete programming (Q1264669) (← links)
- Linear convolution of criteria in multicriteria optimization (Q1290686) (← links)
- Computational study of a linear convolution of criteria in discrete multicriteria programming (Q1374962) (← links)
- The theory of linear parametrization of criteria in multicriteria optimization (Q1380276) (← 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)
- Neural networks and combinatorial optimization (Q1922446) (← links)
- The linear convolution of criteria in the bicriteria traveling salesman problem (Q1975097) (← links)
- (Q3914767) (← links)
- (Q4120329) (← links)
- (Q4147887) (← links)
- (Q4160675) (← links)
- (Q4168407) (← links)
- (Q4391175) (← links)
- Study of the linear parametrization of criteria in the bicriteria knapsack problem (Q5932933) (← links)