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

Материал из DISCOPAL
Перейти к: навигация, поиск

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

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

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

  1. 0x1-classification
  2. Arxiv/A Matheuristic for the Electric Vehicle Routing Problem with Time Windows 2015 1506.00211
  3. Arxiv/A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW 2015 1502.01972
  4. Arxiv/A PTAS for Capacitated Vehicle Routing on Trees 2021 2111.03735
  5. Arxiv/A Quantum Annealing Approach to Reduce Covid-19 Spread on College Campuses 2021 2112.01220
  6. Arxiv/A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem 2014 1409.5166
  7. Arxiv/A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem 2020 2012.11021
  8. Arxiv/An Adaptive Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem 2021 2111.12821
  9. Arxiv/An Empirical Investigation of Four Well-Known Polynomial-Size VRP Formulations 2018 1810.00199
  10. Arxiv/Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension 2021 2106.15034
  11. Arxiv/Approximation in (Poly-) Logarithmic Space 2020 2008.04416
  12. Arxiv/Capacitated Vehicle Routing with Target Geometric Constraints 2021 2107.10382
  13. Arxiv/Comparison of Randomized Solutions for Constrained Vehicle Routing Problem 2020 2005.05871
  14. Arxiv/Complex Vehicle Routing with Memory Augmented Neural Networks 2020 2009.10520
  15. Arxiv/Data Driven VRP — A Neural Network Model to Learn Hidden Preferences for VRP 2021 2108.04578
  16. Arxiv/Decentralized Personalized Federated Min-Max Problems 2021 2106.07289
  17. Arxiv/Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem 2021 2110.02629
  18. Arxiv/Distributed Saddle-Point Problems Under Similarity 2021 2107.10706
  19. Arxiv/Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information 2021 2109.05198
  20. Arxiv/Fast Approximate Solutions using Reinforcement Learning for Dynamic Capacitated Vehicle Routing with Time Windows 2021 2102.12088
  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 D-Vector Covering
  105. Hardprob/Maximum Distinguished Ones
  106. Hardprob/Maximum Edge Subgraph
  107. Hardprob/Maximum Horn Core
  108. Hardprob/Maximum Independent Sequence
  109. Hardprob/Maximum Integral K-Multicommodity Flow On Trees
  110. Hardprob/Maximum K-Colorable Induced Subgraph
  111. Hardprob/Maximum K-Colorable Subgraph
  112. Hardprob/Maximum K-Constraint Satisfaction
  113. Hardprob/Maximum K-Cut
  114. Hardprob/Maximum K-Facility Dispersion
  115. Hardprob/Maximum K-Facility Location
  116. Hardprob/Maximum Minimum Metric K-Spanning Tree
  117. Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
  118. Hardprob/Maximum Number Of Satisfiable Formulas
  119. Hardprob/Maximum Packing Integer Programming
  120. Hardprob/Maximum Priority Flow
  121. Hardprob/Maximum Quadratic Assignment
  122. Hardprob/Maximum Renamable Horn Subformula
  123. Hardprob/Maximum Satisfying Linear Subsystem
  124. Hardprob/Maximum Subforest
  125. Hardprob/Maximum Weighted Satisfiability With Bound
  126. Hardprob/Minimum 3-Dedicated Processor Scheduling
  127. Hardprob/Minimum Array Partition
  128. Hardprob/Minimum B-Balanced Cut
  129. Hardprob/Minimum B-Vertex Separator
  130. Hardprob/Minimum Bend Number
  131. Hardprob/Minimum Block-Angular Convex Programming
  132. Hardprob/Minimum Bottleneck Path Matching
  133. Hardprob/Minimum Bounded Diameter Augmentation
  134. Hardprob/Minimum Chinese Postman For Mixed Graphs
  135. Hardprob/Minimum Color Sum
  136. Hardprob/Minimum Covering Integer Programming
  137. Hardprob/Minimum Cut Cover
  138. Hardprob/Minimum Diameters Decomposition
  139. Hardprob/Minimum Distinguished Ones
  140. Hardprob/Minimum Dynamic Storage Allocation
  141. Hardprob/Minimum Edge Deletion K-Partition
  142. Hardprob/Minimum Edge Deletion To Obtain Subgraph With Property P
  143. Hardprob/Minimum Edge K-Spanner
  144. Hardprob/Minimum Equivalence Deletion
  145. Hardprob/Minimum Facility Location
  146. Hardprob/Minimum File Transfer Scheduling
  147. Hardprob/Minimum Generalized 0-1 Assignment
  148. Hardprob/Minimum Generalized Steiner Network
  149. Hardprob/Minimum Geometric 3-Degree Spanning Tree
  150. Hardprob/Minimum Geometric Disk Cover
  151. Hardprob/Minimum Graph Inference
  152. Hardprob/Minimum Graph Motion Planning
  153. Hardprob/Minimum Graph Transformation
  154. Hardprob/Minimum Height Two Dimensional Packing
  155. Hardprob/Minimum K-Capacitated Tree Partition
  156. Hardprob/Minimum K-Clustering Sum
  157. Hardprob/Minimum K-Cut
  158. Hardprob/Minimum K-Edge Connected Subgraph
  159. Hardprob/Minimum K-Spanning Tree
  160. Hardprob/Minimum K-Stacker Crane Problem
  161. Hardprob/Minimum K-Supplier
  162. Hardprob/Minimum K-Switching Network
  163. Hardprob/Minimum Length Equivalent Frege Proof
  164. Hardprob/Minimum Locally Testable Automaton Order
  165. Hardprob/Minimum Metric Traveling K-Salesperson Problem
  166. Hardprob/Minimum Metric Traveling Salesperson Problem
  167. Hardprob/Minimum Multi Cut
  168. Hardprob/Minimum Multiprocessor Scheduling With Speed Factors
  169. Hardprob/Minimum Multiway Cut
  170. Hardprob/Minimum Network Inhibition On Planar Graphs
  171. Hardprob/Minimum Number Of Satisfiable Formulas
  172. Hardprob/Minimum Parallel Processor Total Flow Time
  173. Hardprob/Minimum Permutation Group Base
  174. Hardprob/Minimum Planar Record Packing
  175. Hardprob/Minimum Point-To-Point Connection
  176. Hardprob/Minimum Precedence Constrained Sequencing With Delays
  177. Hardprob/Minimum Quadratic 0-1 Assignment
  178. Hardprob/Minimum Quotient Cut
  179. Hardprob/Minimum Ratio-Cut
  180. Hardprob/Minimum Rectangle Tiling
  181. Hardprob/Minimum Rectilinear Global Routing
  182. Hardprob/Minimum Routing Tree Congestion
  183. Hardprob/Minimum Schedule Length
  184. Hardprob/Minimum Separating Subdivision
  185. Hardprob/Minimum Sequencing With Release Times
  186. Hardprob/Minimum Single Sink Edge Installation
  187. Hardprob/Minimum Storage Time Sequencing
  188. Hardprob/Minimum Travel Robot Localization
  189. Hardprob/Minimum Traveling Repairman
  190. Hardprob/Minimum Tree Compact Packing
  191. Hardprob/Minimum Tree Width
  192. Hardprob/Minimum Unsatisfying Linear Subsystem
  193. Hardprob/Minimum Unsplittable Flow
  194. Hardprob/Minimum Upgrading Spanning Tree
  195. Hardprob/Minimum Vehicle Scheduling On Tree
  196. Hardprob/Minimum Vertex Deletion To Obtain Connected Subgraph With Property P
  197. Hardprob/Minimum Vertex Deletion To Obtain Subgraph With Property P
  198. Hardprob/Minimum Vertex Disjoint Cycle Cover
  199. Hardprob/Minimum Vertex K-Cut
  200. Hardprob/Nearest Lattice Vector
  201. Hardprob/Shortest Computation
  202. Hardprob/Shortest Path With Forbidden Pairs
  203. How to use Ansible and Vagrant for Windows
  204. HuaweiVRP
  205. ISO in NP
  206. ISO in NP/Решение Иноземцев
  207. Igraph
  208. Jupyterization
  209. Jupyterization/2018
  210. Kozlinskii/DIVSTR
  211. Lab
  212. Lab17
  213. MAX-CUT: вероятностное округление
  214. MAX-CUT: вероятностное округление/MAX-CUT на Matlab
  215. MAX-CUT: вероятностное округление/Задачи
  216. MAX-CUT: вероятностное округление/Задачи/0.5-приближенный вероятностный для MAX-CUT
  217. MAX-CUT: вероятностное округление/Задачи/ex-min-maxmatching-1-2
  218. MAX-CUT: вероятностное округление/Задачи/max-cut-equal-partition-polinomial-local-search
  219. MAX-CUT: вероятностное округление/Задачи/merge-vertices
  220. MAX-CUT: вероятностное округление/Задачи/Матожидание разреза
  221. MAX-SAT-Weighted
  222. MAX-SAT: вероятностное округление/Задачи
  223. MAX-SAT: вероятностное округление/Задачи/MAX-3ESAT
  224. MAX-SAT: вероятностное округление/Задачи/MAX-SAT-1-2-expected-time
  225. MAX-SAT: вероятностное округление/Задачи/MAX-SAT-random-t-samples
  226. MAX-SAT: вероятностное округление/Задачи/eupce-6-1-a
  227. MAX-SAT: вероятностное округление/Задачи/eupce-6-3-a
  228. MAX-SAT: вероятностное округление/Задачи/max-sat-local-opt--1-2
  229. MAX-SAT: вероятностное округление/Задачи/не более половины скобок
  230. MAX-SAT: дерандомизация/Задачи
  231. MAX-SAT: дерандомизация/Задачи/2-приближенный алгоритм для максимальной совместной подсистемы
  232. MAX-SAT: дерандомизация/Задачи/ex-derand-maxsat-f0-f1
  233. MAX-SAT: дерандомизация/Задачи/shell-game
  234. MAX-SAT: дерандомизация/Задачи/Комбинированная дерандомизация
  235. Main Page
  236. Maximum Integer d-dimentional Knapsack
  237. Maximum Integer k-choice Knapsack
  238. Minimum Hitting Set
  239. Minimum Multicover
  240. Modularity (formula)
  241. Nnkuz
  242. Nnkuz-bib.html
  243. OptimizePython
  244. Optprob/Аэроперелет для туристов
  245. Optprob/Выбор внеклассных мероприятий
  246. Optprob/Выбор места для завода стиральных машин
  247. Optprob/Выход на рынок запчастей
  248. Optprob/Граф проекта, PERT-анализ
  249. Optprob/Игра UnblockMe
  250. Optprob/Кондитерская фабрика и производство конфет

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