Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnyj analiz i issledovanie operacij
Tome 7 (2000)
no. 1
Précédent Suivant

Sommaire


The plant location problem on a~two-tree with bounded communication capacities
I. P. Voznyuk
p. 3-8

Polynomial solvability of scheduling problems with storable resources and directive deadlines
E. Kh. Gimadi ; V. V. Zalyubovskii ; S. V. Sevast'yanov
p. 9-34

Two-level standardization problems under conditions when the optimal consumer choice is not unique
L. Y. Gorbachevskaya
p. 35-46

A~genetic algorithm for the covering problem
A. V. Eremeev
p. 47-60

On the problem of the linear ordering of vertices of parallel-sequential graphs
G. G. Zabudskii
p. 61-64

An efficient algorithm for the approximate solution of the metric traveling salesman problem
Yu. L. Kostyuk ; S. A. Zhikharev
p. 65-74

An efficiently solvable case of the scheduling problem with renewable resources
V. V. Servakh
p. 75-82

Outerplanar graphs with the metric continuation property. I
T. I. Fedoryaeva
p. 83-112