Везде
ESPECIALTIES IN THE USE OF THE BRANCH AND BOUND TO THE ROUTING PROBLEM WITH INCOMPLETE TRANSPORT GRAPH
Table of contents
Annotation Estimate Publication content
References Comments
Share
QR
Metrics
ESPECIALTIES IN THE USE OF THE BRANCH AND BOUND TO THE ROUTING PROBLEM WITH INCOMPLETE TRANSPORT GRAPH
Annotation
PII
S042473880000616-6-1
Publication type
Article
Status
Published
Authors
Christina Podshivalova  Sergei Podshivalov
Edition
Volume 50 Issue 3
Pages
134-140
Abstract
Study of the degeneration of solutions using branch and bound method for determining the best routes on graphs. Developed an advanced algorithm to get the exact solution. Examples given.
Keywords
graph, route algorithm degeneration
Date of publication
01.07.2014
Number of purchasers
1
Views
778
Readers community rating
0.0 (0 votes)
Cite   Download pdf
1

References



Additional sources and materials

Kozhin A.P., Mezentsev V.N. (1994). Matematicheskie metody planirovaniya i upravleniya gruzovymi avtomobil'nymi perevozkami. M.: Transport.


Pozhidaev M.S. (2010). Algoritmy resheniya zadachi marshrutizatsii transporta. Avtoref. dis. … kand.tekhn. nauk. Tomsk.


Prokof'eva O.S. (2004). Razrabotka metodiki optimizatsii razvozochnykh marshrutov. Avtoref. dis. …kan. tekhn. nauk. Irkutsk.


Litl Dzh., Murti K. (1965). Algoritm dlya resheniya zadachi o kommivoyazhere // Ehkonomika i matematicheskie metody. T. 1. Vyp. 1. S. 94–107.

Comments

No posts found

Write a review
Translate