Scientific paper ID 57 : 2005/2
Mination Of Shortest Ways In Transport Network Using The Dynamic Programming Method

Dimitar Zhivkov Dimitrov

The current paper treats problems connected with the determination of the shortest ways in transport network using the dynamic programming method. A practical problem has been defined and a digital example has been solved in Excel.


най-кратък път граф оптимизация транспортна мрежа динамично програмиранеthe shortest ways graph optimization transport network dynamic programmingDimitar Zhivkov Dimitrov

 

 

 

This site uses cookies as they are important to its work.

Accept all cookies
Cookies Policy