Тупиковые страницы

Следующие страницы не содержат ссылок на другие страницы в этой вики.

Ниже показано до 250 результатов в диапазоне от 21 до 270.

Просмотреть (предыдущие 250 | следующие 250) (20 | 50 | 100 | 250 | 500)

21. Arxiv/Heuristic Rectangle Splitting — Leveraging Single-Objective Heuristics to Efficiently Solve Multi-Objective Problems 2017 1705.10174
22. Arxiv/Heuristics for vehicle routing problems — Sequence or set optimization? 2018 1803.06062
23. Arxiv/Improved Approximations for CVRP with Unsplittable Demands 2021 2111.08138
24. Arxiv/Incentive-aware Electric Vehicle Routing Problem — a Bi-level Model and a Joint Solution Algorithm 2021 2110.06441
25. Arxiv/Integrating Fuzzy and Ant Colony System for Fuzzy Vehicle Routing Problem with Time Windows 2014 1411.3806
26. Arxiv/Learning (Re-)Starting Solutions for Vehicle Routing Problems 2020 2008.03424
27. Arxiv/Learning Collaborative Policies to Solve NP-hard Routing Problems 2021 2110.13987
28. Arxiv/Learning Enhanced Optimisation for Routing Problems 2021 2109.08345
29. Arxiv/Learning Improvement Heuristics for Solving Routing Problems 2020 1912.05784
30. Arxiv/Learning Vehicle Routing Problems using Policy Optimisation 2020 2012.13269
31. Arxiv/Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer 2021 2110.02544
32. Arxiv/Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem 2020 1911.09539
33. Arxiv/NeuroLKH — Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem 2021 2110.07983
34. Arxiv/On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking 2020 2005.05066
35. Arxiv/Online Food Delivery to Minimize Maximum Flow Time 2021 2110.15772
36. Arxiv/POMO — Policy Optimization with Multiple Optima for Reinforcement Learning 2020 2010.16011
37. Arxiv/Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times 2019 1902.03930
38. Arxiv/RP-DQN — An application of Q-Learning to Vehicle Routing Problems 2021 2104.12226
39. Arxiv/Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing 2020 2010.12001
40. Arxiv/Route Optimization via Environment-Aware Deep Network and Reinforcement Learning 2021 2111.09124
41. Arxiv/Solve routing problems with a residual edge-graph attention neural network 2021 2105.02730
42. Arxiv/Solving Area Coverage Problem with UAVs — A Vehicle Routing with Time Windows Variation 2020 2003.07124
43. Arxiv/The fragility-constrained vehicle routing problem with time windows 2021 2109.01883
44. Arxiv/The vehicle routing problem with drones and drone speed selection 2021 2111.13050
45. Arxiv/Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP 2021 2102.00567
46. Arxiv/Vehicle Routing Problem with Time Windows — A Deterministic Annealing approach 2016 1604.03590
47. Arxiv/dMFEA-II — An Adaptive Multifactorial Evolutionary Algorithm for Permutation-based Discrete Optimization Problems 2020 2004.06559
48. Blockchain-research
49. Chefstr2.py
50. Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
51. Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
52. Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
53. Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
54. Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
55. Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
56. Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
57. Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
58. Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
59. Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
60. Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
61. Citeseer/Construction of New Classes of Knapsack Type Public Key Cryptosystem Using Uniform Secret Sequence, K(II)ΣΠPKC, Constructed Based on Maximum Length Code (2012) 10.1.1.261.2176
62. Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
63. Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
64. Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
65. Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
66. Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
67. Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
68. Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
69. Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
70. Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
71. Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
72. Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
73. Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
74. Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
75. Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
76. Climbing stairs
77. Cocalc on Fedora
78. Coq
79. Digprime.py
80. Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
81. DocMarking/TestCases
82. DocStruct
83. DocStruct/ToDo
84. Dynamic Group Detection/Datasets
85. Dynamic Group Detection/Datasets/Last.fm with friends/Similarity/Notes
86. En.contacts.htm
87. En.cs-isp-sbornik-1.htm
88. En.cs-isp-sbornik-2006-05.htm
89. En.cs-isp-sbornik-2006-12.htm
90. En.network cover.htm
91. En.plpapx.htm
92. Everyones an influencer. quantifying influence on twitter (Bakshy, Hofman, Mason, Watts, 2011)
93. Fibo-fragment-cpp
94. GRE-CS-v01
95. Greedy algorithm for SAT
96. Hardprob/Longest Computation
97. Hardprob/Maximum Balanced Connected Partition
98. Hardprob/Maximum Capacity Representatives
99. Hardprob/Maximum Class-Constrained Knapsack
100. Hardprob/Maximum Common Embedded Sub-Tree
101. Hardprob/Maximum Common Induced Subgraph
102. Hardprob/Maximum Common Point Set
103. Hardprob/Maximum Common Subtree
104. Hardprob/Maximum Distinguished Ones
105. Hardprob/Maximum Edge Subgraph
106. Hardprob/Maximum Horn Core
107. Hardprob/Maximum Independent Sequence
108. Hardprob/Maximum Integral K-Multicommodity Flow On Trees
109. Hardprob/Maximum K-Colorable Induced Subgraph
110. Hardprob/Maximum K-Colorable Subgraph
111. Hardprob/Maximum K-Constraint Satisfaction
112. Hardprob/Maximum K-Cut
113. Hardprob/Maximum K-Facility Dispersion
114. Hardprob/Maximum K-Facility Location
115. Hardprob/Maximum Minimum Metric K-Spanning Tree
116. Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
117. Hardprob/Maximum Number Of Satisfiable Formulas
118. Hardprob/Maximum Packing Integer Programming
119. Hardprob/Maximum Priority Flow
120. Hardprob/Maximum Quadratic Assignment
121. Hardprob/Maximum Renamable Horn Subformula
122. Hardprob/Maximum Satisfying Linear Subsystem
123. Hardprob/Maximum Subforest
124. Hardprob/Maximum Weighted Satisfiability With Bound
125. Hardprob/Minimum 3-Dedicated Processor Scheduling
126. Hardprob/Minimum Array Partition
127. Hardprob/Minimum B-Balanced Cut
128. Hardprob/Minimum B-Vertex Separator
129. Hardprob/Minimum Bend Number
130. Hardprob/Minimum Block-Angular Convex Programming
131. Hardprob/Minimum Bottleneck Path Matching
132. Hardprob/Minimum Bounded Diameter Augmentation
133. Hardprob/Minimum Chinese Postman For Mixed Graphs
134. Hardprob/Minimum Color Sum
135. Hardprob/Minimum Covering Integer Programming
136. Hardprob/Minimum Cut Cover
137. Hardprob/Minimum Diameters Decomposition
138. Hardprob/Minimum Distinguished Ones
139. Hardprob/Minimum Dynamic Storage Allocation
140. Hardprob/Minimum Edge Deletion K-Partition
141. Hardprob/Minimum Edge Deletion To Obtain Subgraph With Property P
142. Hardprob/Minimum Edge K-Spanner
143. Hardprob/Minimum Equivalence Deletion
144. Hardprob/Minimum Facility Location
145. Hardprob/Minimum File Transfer Scheduling
146. Hardprob/Minimum Generalized 0-1 Assignment
147. Hardprob/Minimum Generalized Steiner Network
148. Hardprob/Minimum Geometric 3-Degree Spanning Tree
149. Hardprob/Minimum Geometric Disk Cover
150. Hardprob/Minimum Graph Inference
151. Hardprob/Minimum Graph Motion Planning
152. Hardprob/Minimum Graph Transformation
153. Hardprob/Minimum Height Two Dimensional Packing
154. Hardprob/Minimum K-Capacitated Tree Partition
155. Hardprob/Minimum K-Clustering Sum
156. Hardprob/Minimum K-Cut
157. Hardprob/Minimum K-Edge Connected Subgraph
158. Hardprob/Minimum K-Spanning Tree
159. Hardprob/Minimum K-Stacker Crane Problem
160. Hardprob/Minimum K-Supplier
161. Hardprob/Minimum K-Switching Network
162. Hardprob/Minimum Length Equivalent Frege Proof
163. Hardprob/Minimum Locally Testable Automaton Order
164. Hardprob/Minimum Metric Traveling K-Salesperson Problem
165. Hardprob/Minimum Multi Cut
166. Hardprob/Minimum Multiprocessor Scheduling With Speed Factors
167. Hardprob/Minimum Multiway Cut
168. Hardprob/Minimum Network Inhibition On Planar Graphs
169. Hardprob/Minimum Number Of Satisfiable Formulas
170. Hardprob/Minimum Parallel Processor Total Flow Time
171. Hardprob/Minimum Permutation Group Base
172. Hardprob/Minimum Planar Record Packing
173. Hardprob/Minimum Point-To-Point Connection
174. Hardprob/Minimum Precedence Constrained Sequencing With Delays
175. Hardprob/Minimum Quadratic 0-1 Assignment
176. Hardprob/Minimum Quotient Cut
177. Hardprob/Minimum Ratio-Cut
178. Hardprob/Minimum Rectangle Tiling
179. Hardprob/Minimum Rectilinear Global Routing
180. Hardprob/Minimum Routing Tree Congestion
181. Hardprob/Minimum Schedule Length
182. Hardprob/Minimum Separating Subdivision
183. Hardprob/Minimum Sequencing With Release Times
184. Hardprob/Minimum Single Sink Edge Installation
185. Hardprob/Minimum Storage Time Sequencing
186. Hardprob/Minimum Travel Robot Localization
187. Hardprob/Minimum Traveling Repairman
188. Hardprob/Minimum Tree Compact Packing
189. Hardprob/Minimum Tree Width
190. Hardprob/Minimum Unsatisfying Linear Subsystem
191. Hardprob/Minimum Unsplittable Flow
192. Hardprob/Minimum Upgrading Spanning Tree
193. Hardprob/Minimum Vehicle Scheduling On Tree
194. Hardprob/Minimum Vertex Deletion To Obtain Connected Subgraph With Property P
195. Hardprob/Minimum Vertex Deletion To Obtain Subgraph With Property P
196. Hardprob/Minimum Vertex Disjoint Cycle Cover
197. Hardprob/Minimum Vertex K-Cut
198. Hardprob/Nearest Lattice Vector
199. Hardprob/Shortest Computation
200. Hardprob/Shortest Path With Forbidden Pairs
201. How to use Ansible and Vagrant for Windows
202. HuaweiVRP
203. ISO in NP
204. ISO in NP/Решение Иноземцев
205. Igraph
206. Jupyterization
207. Jupyterization/2018
208. Kozlinskii/DIVSTR
209. Lab
210. Lab17
211. MAX-CUT: вероятностное округление
212. MAX-CUT: вероятностное округление/MAX-CUT на Matlab
213. MAX-CUT: вероятностное округление/Задачи
214. MAX-CUT: вероятностное округление/Задачи/0.5-приближенный вероятностный для MAX-CUT
215. MAX-CUT: вероятностное округление/Задачи/ex-min-maxmatching-1-2
216. MAX-CUT: вероятностное округление/Задачи/max-cut-equal-partition-polinomial-local-search
217. MAX-CUT: вероятностное округление/Задачи/merge-vertices
218. MAX-CUT: вероятностное округление/Задачи/Матожидание разреза
219. MAX-SAT-Weighted
220. MAX-SAT: вероятностное округление/Задачи
221. MAX-SAT: вероятностное округление/Задачи/MAX-3ESAT
222. MAX-SAT: вероятностное округление/Задачи/MAX-SAT-1-2-expected-time
223. MAX-SAT: вероятностное округление/Задачи/MAX-SAT-random-t-samples
224. MAX-SAT: вероятностное округление/Задачи/eupce-6-1-a
225. MAX-SAT: вероятностное округление/Задачи/eupce-6-3-a
226. MAX-SAT: вероятностное округление/Задачи/max-sat-local-opt--1-2
227. MAX-SAT: вероятностное округление/Задачи/не более половины скобок
228. MAX-SAT: дерандомизация/Задачи
229. MAX-SAT: дерандомизация/Задачи/2-приближенный алгоритм для максимальной совместной подсистемы
230. MAX-SAT: дерандомизация/Задачи/ex-derand-maxsat-f0-f1
231. MAX-SAT: дерандомизация/Задачи/shell-game
232. MAX-SAT: дерандомизация/Задачи/Комбинированная дерандомизация
233. Main Page
234. Maximum Integer d-dimentional Knapsack
235. Maximum Integer k-choice Knapsack
236. Min Sum k-Clustering
237. Minimum Hitting Set
238. Minimum Multicover
239. Modularity (formula)
240. Nnkuz
241. Nnkuz-bib.html
242. OptimizePython
243. Optprob/Аэроперелет для туристов
244. Optprob/Выбор внеклассных мероприятий
245. Optprob/Выбор места для завода стиральных машин
246. Optprob/Выход на рынок запчастей
247. Optprob/Граф проекта, PERT-анализ
248. Optprob/Игра UnblockMe
249. Optprob/Кондитерская фабрика и производство конфет
250. Optprob/Критический путь для проекта по таблице
251. Optprob/Критический путь для проекта по таблице-02
252. Optprob/Критический путь для проекта по таблице-03
253. Optprob/Критический путь проекта по графу - 01
254. Optprob/Критический путь проекта по графу - 02
255. Optprob/Максимальный поток на графе
256. Optprob/Маршруты для грузовиков
257. Optprob/Назначение предметов на аудитории
258. Optprob/Найм временного работника
259. Optprob/Онлайн-распродажа в овощном магазине
260. Optprob/Оптимизация двух производственных линий
261. Optprob/Оптимизация использования разных станков
262. Optprob/Охрана аптек
263. Optprob/Парковки для электромобилей
264. Optprob/Плантации
265. Optprob/Политика замены оборудования
266. Optprob/Проект годовой отчетности компании
267. Optprob/Проект киносьемки
268. Optprob/Производство двух продуктов на трех станках
269. Optprob/Производство и распределение
270. Optprob/Производство мыла

Просмотреть (предыдущие 250 | следующие 250) (20 | 50 | 100 | 250 | 500)