I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
2003, VOLUME 9, NUMBER 1, PAGES 235-251
Algorithms and methods for solving scheduling problems and other
extremum problems on large-scale graphs
View as HTML
View as gif image
We consider a large-scale directed graph whose edges are
endowed with a family of characteristics.
A subset of vertices of the graph, , is selected and some additional conditions are
imposed on these vertices.
An algorithm for reducing the optimization problem on the
an optimization problem on the graph of a lower
dimension is developed.
The main steps of the solution and some methods for constructing an
approximate solution to the problem on the transformed
Last modified: April 4, 2004.