Участник:StasFomin/Bookmarks/Algorithms — различия между версиями

Материал из DISCOPAL
Перейти к: навигация, поиск
(Добавлена закладка A method for designing minimum‐cost multisource multisink network layouts - Heijnen - 2020 - Systems Engineering - Wiley Online Library)
(Добавлена закладка OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks - ScienceDirect)
Строка 2: Строка 2:
 
=== 2020-11 ===
 
=== 2020-11 ===
  
 +
* 2020-11-26, 01:24:15: [https://www.sciencedirect.com/science/article/pii/S0198971516303970?via%3Dihub OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks - ScienceDirect]
 
* 2020-11-17, 09:41:05: [https://onlinelibrary.wiley.com/doi/full/10.1002/sys.21492 A method for designing minimum‐cost multisource multisink network layouts - Heijnen - 2020 - Systems Engineering - Wiley Online Library]
 
* 2020-11-17, 09:41:05: [https://onlinelibrary.wiley.com/doi/full/10.1002/sys.21492 A method for designing minimum‐cost multisource multisink network layouts - Heijnen - 2020 - Systems Engineering - Wiley Online Library]
 
* 2020-11-17, 09:40:42: [https://cs.stackexchange.com/questions/70490/minimizing-transportation-cost-through-a-network-multiple-source-sinks algorithms - Minimizing transportation cost through a network, multiple source/sinks - Computer Science Stack Exchange]
 
* 2020-11-17, 09:40:42: [https://cs.stackexchange.com/questions/70490/minimizing-transportation-cost-through-a-network-multiple-source-sinks algorithms - Minimizing transportation cost through a network, multiple source/sinks - Computer Science Stack Exchange]

Версия 22:24, 25 ноября 2020

2020

2020-11

2020-10

2020-09

2020-08

2020-07