O. G. Alekseev

Available identifiers

zbMath Open alekseev.o-gMaRDI QIDQ918399

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4297169	1994-07-25	Paper
Experimental estimate of the efficiency of an algorithm for solving the minimax travelling salesman problem	1994-07-06	Paper
Application of the resolving multipliers of the modified simplex method in problems of integer linear programming	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3211109	1990-01-01	Paper
The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3494381	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5202793	1990-01-01	Paper
A generalized location problem	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3032062	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3035137	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3484622	1988-01-01	Paper
An experimental estimate of the effectiveness of using duality to solve discrete programing problems	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3026739	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3757674	1986-01-01	Paper
The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem	1985-01-01	Paper
Some algorithms for solving the covering problem, and their experimental study on a computer	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3956766	1982-01-01	Paper
The dynamic problem of standardization	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3955161	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3902858	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3942734	1979-01-01	Paper
A minimax scheduling problem	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3907406	1978-01-01	Paper
A class of integer programming problems	1978-01-01	Paper
Optimization of parameter monotoring sequence when checking time is limited	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4143014	1977-01-01	Paper
Combined use of dynamic programming and branch-and-bound methods in discrete-programming problems	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4120327	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5181058	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4771780	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5179995	1973-01-01	Paper
An algorithm for determining the shortest path on a network graph	1973-01-01	Paper
Use of the principle of invariant imbedding in solving an optimal control problem	1972-01-01	Paper
The use of complementability in the solution of integer programming problems	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4402921	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5648251	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5619450	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5633833	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5538615	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5332538	1964-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: O. G. Alekseev