Везде
USING THE MAZE PROBLEM WHEN SOLVING TRANSPORT TASKS IN THE NETWORK STATEMENT
Table of contents
Annotation Estimate Publication content
References Comments
Share
QR
Metrics
USING THE MAZE PROBLEM WHEN SOLVING TRANSPORT TASKS IN THE NETWORK STATEMENT
Annotation
PII
S042473880000621-2-
Publication type
Article
Status
Published
Authors
N Nikitina  Joseph Romanovsky
Edition
Volume 2 Issue 2
Pages
262-271
Abstract
Экономика и математические методы, USING THE MAZE PROBLEM WHEN SOLVING TRANSPORT TASKS IN THE NETWORK STATEMENT
Date of publication
06.03.1966
Number of purchasers
0
Views
752
Readers community rating
0.0 (0 votes)
Previous versions
S042473880000621-2-1 Дата внесения правок в статью - 26.03.2021
Cite   Download pdf Download JATS

References



Additional sources and materials


 V. S. Mikhalevich, N. Z. Shor, A, A. Bakaev, S. V. Brapovptskaya.  Algoritm i opyt resheniya setevykh transportnykh zadach. V sb. Matematicheskie metody i problemy razmescheniya proizvodstva. M., Ehkonompzdat, 1963.
 L. M. Dudkin, T. A. Kosenko, M. Kh. Yusupov. Razmeschenie, spetsializatsiya i kooperirovanie promyshlennogo proizvodstva kak zadachi optimal'nogo pro-GRammirovaniya. V sb. Primenenie matematiki v ehkonomicheskikh issledovaniyakh.t. 2. m., sotsehkgiz, 1961.

Comments

No posts found

Write a review
Translate