Страницы без интервики-ссылок

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

Следующие страницы не имеют интервики-ссылок:

Префикс  

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

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

  1. 0x1-classification
  2. 2-Выполнимость
  3. 2SAT
  4. 2SAT:Решение
  5. 3-Выполнимость
  6. 3ESAT
  7. 3SAT
  8. A
  9. Advanced Algorithms/2020-12-01 Feedback
  10. Advanced Algorithms/2020-12-15 Feedback
  11. Advanced Algorithms/2021-03-11
  12. Arxiv/A Matheuristic for the Electric Vehicle Routing Problem with Time Windows 2015 1506.00211
  13. Arxiv/A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW 2015 1502.01972
  14. Arxiv/A PTAS for Capacitated Vehicle Routing on Trees 2021 2111.03735
  15. Arxiv/A Quantum Annealing Approach to Reduce Covid-19 Spread on College Campuses 2021 2112.01220
  16. Arxiv/A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem 2014 1409.5166
  17. Arxiv/A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem 2020 2012.11021
  18. Arxiv/An Adaptive Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem 2021 2111.12821
  19. Arxiv/An Empirical Investigation of Four Well-Known Polynomial-Size VRP Formulations 2018 1810.00199
  20. Arxiv/Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension 2021 2106.15034
  21. Arxiv/Approximation in (Poly-) Logarithmic Space 2020 2008.04416
  22. Arxiv/Capacitated Vehicle Routing with Target Geometric Constraints 2021 2107.10382
  23. Arxiv/Comparison of Randomized Solutions for Constrained Vehicle Routing Problem 2020 2005.05871
  24. Arxiv/Complex Vehicle Routing with Memory Augmented Neural Networks 2020 2009.10520
  25. Arxiv/Data Driven VRP — A Neural Network Model to Learn Hidden Preferences for VRP 2021 2108.04578
  26. Arxiv/Decentralized Personalized Federated Min-Max Problems 2021 2106.07289
  27. Arxiv/Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem 2021 2110.02629
  28. Arxiv/Distributed Saddle-Point Problems Under Similarity 2021 2107.10706
  29. Arxiv/Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information 2021 2109.05198
  30. Arxiv/Fast Approximate Solutions using Reinforcement Learning for Dynamic Capacitated Vehicle Routing with Time Windows 2021 2102.12088
  31. Arxiv/Heuristic Rectangle Splitting — Leveraging Single-Objective Heuristics to Efficiently Solve Multi-Objective Problems 2017 1705.10174
  32. Arxiv/Heuristics for vehicle routing problems — Sequence or set optimization? 2018 1803.06062
  33. Arxiv/Improved Approximations for CVRP with Unsplittable Demands 2021 2111.08138
  34. Arxiv/Incentive-aware Electric Vehicle Routing Problem — a Bi-level Model and a Joint Solution Algorithm 2021 2110.06441
  35. Arxiv/Integrating Fuzzy and Ant Colony System for Fuzzy Vehicle Routing Problem with Time Windows 2014 1411.3806
  36. Arxiv/Learning (Re-)Starting Solutions for Vehicle Routing Problems 2020 2008.03424
  37. Arxiv/Learning Collaborative Policies to Solve NP-hard Routing Problems 2021 2110.13987
  38. Arxiv/Learning Enhanced Optimisation for Routing Problems 2021 2109.08345
  39. Arxiv/Learning Improvement Heuristics for Solving Routing Problems 2020 1912.05784
  40. Arxiv/Learning Vehicle Routing Problems using Policy Optimisation 2020 2012.13269
  41. Arxiv/Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer 2021 2110.02544
  42. Arxiv/Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem 2020 1911.09539
  43. Arxiv/NeuroLKH — Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem 2021 2110.07983
  44. Arxiv/On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking 2020 2005.05066
  45. Arxiv/Online Food Delivery to Minimize Maximum Flow Time 2021 2110.15772
  46. Arxiv/POMO — Policy Optimization with Multiple Optima for Reinforcement Learning 2020 2010.16011
  47. Arxiv/Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times 2019 1902.03930
  48. Arxiv/RP-DQN — An application of Q-Learning to Vehicle Routing Problems 2021 2104.12226
  49. Arxiv/Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing 2020 2010.12001
  50. Arxiv/Route Optimization via Environment-Aware Deep Network and Reinforcement Learning 2021 2111.09124
  51. Arxiv/Solve routing problems with a residual edge-graph attention neural network 2021 2105.02730
  52. Arxiv/Solving Area Coverage Problem with UAVs — A Vehicle Routing with Time Windows Variation 2020 2003.07124
  53. Arxiv/The fragility-constrained vehicle routing problem with time windows 2021 2109.01883
  54. Arxiv/The vehicle routing problem with drones and drone speed selection 2021 2111.13050
  55. Arxiv/Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP 2021 2102.00567
  56. Arxiv/Vehicle Routing Problem with Time Windows — A Deterministic Annealing approach 2016 1604.03590
  57. Arxiv/dMFEA-II — An Adaptive Multifactorial Evolutionary Algorithm for Permutation-based Discrete Optimization Problems 2020 2004.06559
  58. BPP
  59. Blockchain-research
  60. Chefstr2.py
  61. Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
  62. Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
  63. Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
  64. Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
  65. Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
  66. Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
  67. Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
  68. Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
  69. Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
  70. Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
  71. Citeseer/Bandits with knapsacks (2013) 10.1.1.744.7353
  72. Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
  73. 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
  74. Citeseer/Convexity and solutions of stochastic Multidimensional Knapsack Problems with Probabilistic Constraints (2012) 10.1.1.258.3304
  75. Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
  76. Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
  77. Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
  78. Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
  79. Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
  80. Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
  81. Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
  82. Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
  83. Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
  84. Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
  85. Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
  86. Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
  87. Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
  88. Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
  89. Climbing stairs
  90. CoNP
  91. CoRP
  92. Cocalc on Fedora
  93. Coq
  94. Courses
  95. DSPACE
  96. DTIME
  97. Digprime.py
  98. Diplom-tunev
  99. Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
  100. DocMarking/Алгоритмы
  101. DocStruct
  102. EXPTIME
  103. En.book-advanced-algorithms.htm
  104. En.contacts.htm
  105. En.cs-isp-sbornik-1.htm
  106. En.cs-isp-sbornik-2006-05.htm
  107. En.cs-isp-sbornik-2006-12.htm
  108. En.cs-isp-sborniks.htm
  109. En.index.htm
  110. En.isp-guidelines.htm
  111. En.lectures-lattice-based-cryptography.htm
  112. En.lectures-mipt.htm
  113. En.lectures.htm
  114. En.network cover.htm
  115. En.nnkuzbib.htm
  116. En.plpapx.htm
  117. Everyones an influencer. quantifying influence on twitter (Bakshy, Hofman, Mason, Watts, 2011)
  118. Fibo-fragment-cpp
  119. GRE-CS-v01
  120. Geome try/codechef ENC2020F
  121. Geome try/codechef KAN13F
  122. Geome try/codechef MCO16204
  123. Greedy algorithm for SAT
  124. Hardprob/Longest Common Subsequence
  125. Hardprob/Longest Computation
  126. Hardprob/Longest Path
  127. Hardprob/Longest Path With Forbidden Pairs
  128. Hardprob/Maximum 3-Dimensional Matching
  129. Hardprob/Maximum Achromatic Number
  130. Hardprob/Maximum Balanced Connected Partition
  131. Hardprob/Maximum Bounded 0-1 Programming
  132. Hardprob/Maximum Capacity Representatives
  133. Hardprob/Maximum Class-Constrained Knapsack
  134. Hardprob/Maximum Clique
  135. Hardprob/Maximum Common Embedded Sub-Tree
  136. Hardprob/Maximum Common Induced Subgraph
  137. Hardprob/Maximum Common Point Set
  138. Hardprob/Maximum Common Subgraph
  139. Hardprob/Maximum Common Subtree
  140. Hardprob/Maximum Constrained Partition
  141. Hardprob/Maximum Constrained Sequencing To Minimize Tardy Task Weight
  142. Hardprob/Maximum Cut
  143. Hardprob/Maximum D-Vector Covering
  144. Hardprob/Maximum Degree Bounded Connected Subgraph
  145. Hardprob/Maximum Directed Cut
  146. Hardprob/Maximum Disjoint Connecting Paths
  147. Hardprob/Maximum Distinguished Ones
  148. Hardprob/Maximum Domatic Partition
  149. Hardprob/Maximum Edge Subgraph
  150. Hardprob/Maximum H-Matching
  151. Hardprob/Maximum Horn Core
  152. Hardprob/Maximum Hyperplane Consistency
  153. Hardprob/Maximum Independent Sequence
  154. Hardprob/Maximum Independent Set
  155. Hardprob/Maximum Induced Connected Subgraph With Property P
  156. Hardprob/Maximum Induced Subgraph With Property P
  157. Hardprob/Maximum Integer K-Choice Knapsack
  158. Hardprob/Maximum Integer M-Dimensional Knapsack
  159. Hardprob/Maximum Integral K-Multicommodity Flow On Trees
  160. Hardprob/Maximum K-Colorable Induced Subgraph
  161. Hardprob/Maximum K-Colorable Subgraph
  162. Hardprob/Maximum K-Constraint Satisfaction
  163. Hardprob/Maximum K-Cut
  164. Hardprob/Maximum K-Facility Dispersion
  165. Hardprob/Maximum K-Facility Location
  166. Hardprob/Maximum K-Satisfiability
  167. Hardprob/Maximum Knapsack
  168. Hardprob/Maximum Leaf Spanning Tree
  169. Hardprob/Maximum Minimum Metric K-Spanning Tree
  170. Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
  171. Hardprob/Maximum Not-All-Equal 3-Satisfiability
  172. Hardprob/Maximum Number Of Satisfiable Formulas
  173. Hardprob/Maximum Packing Integer Programming
  174. Hardprob/Maximum Planar Subgraph
  175. Hardprob/Maximum Priority Flow
  176. Hardprob/Maximum Quadratic Assignment
  177. Hardprob/Maximum Quadratic Programming
  178. Hardprob/Maximum Renamable Horn Subformula
  179. Hardprob/Maximum Satisfiability
  180. Hardprob/Maximum Satisfiability Of Quadratic Equations Over Gf(Q)
  181. Hardprob/Maximum Satisfying Linear Subsystem
  182. Hardprob/Maximum Set Packing
  183. Hardprob/Maximum Set Splitting
  184. Hardprob/Maximum Subforest
  185. Hardprob/Maximum Triangle Packing
  186. Hardprob/Maximum Weighted Satisfiability With Bound
  187. Hardprob/Minimum 0-1 Programming
  188. Hardprob/Minimum 3-Dedicated Processor Scheduling
  189. Hardprob/Minimum 3-Dimensional Assignment
  190. Hardprob/Minimum 3-Dnf Satisfiability
  191. Hardprob/Minimum Array Partition
  192. Hardprob/Minimum B-Balanced Cut
  193. Hardprob/Minimum B-Vertex Separator
  194. Hardprob/Minimum Bandwidth
  195. Hardprob/Minimum Bend Number
  196. Hardprob/Minimum Biconnectivity Augmentation
  197. Hardprob/Minimum Bin Packing
  198. Hardprob/Minimum Block-Angular Convex Programming
  199. Hardprob/Minimum Bottleneck Path Matching
  200. Hardprob/Minimum Bounded Diameter Augmentation
  201. Hardprob/Minimum Broadcast Time
  202. Hardprob/Minimum Chinese Postman For Mixed Graphs
  203. Hardprob/Minimum Chordal Graph Completion
  204. Hardprob/Minimum Clique Cover
  205. Hardprob/Minimum Clique Partition
  206. Hardprob/Minimum Color Sum
  207. Hardprob/Minimum Communication Cost Spanning Tree
  208. Hardprob/Minimum Complete Bipartite Subgraph Cover
  209. Hardprob/Minimum Consistent Finite Automaton
  210. Hardprob/Minimum Covering Integer Programming
  211. Hardprob/Minimum Crossing Number
  212. Hardprob/Minimum Cut Cover
  213. Hardprob/Minimum Cut Linear Arrangement
  214. Hardprob/Minimum Degree Spanning Tree
  215. Hardprob/Minimum Diameter Spanning Subgraph
  216. Hardprob/Minimum Diameters Decomposition
  217. Hardprob/Minimum Directed Bandwidth
  218. Hardprob/Minimum Distinguished Ones
  219. Hardprob/Minimum Dominating Set
  220. Hardprob/Minimum Dynamic Storage Allocation
  221. Hardprob/Minimum Edge Coloring
  222. Hardprob/Minimum Edge Deletion K-Partition
  223. Hardprob/Minimum Edge Deletion To Obtain Subgraph With Property P
  224. Hardprob/Minimum Edge Dominating Set
  225. Hardprob/Minimum Edge K-Spanner
  226. Hardprob/Minimum Equivalence Deletion
  227. Hardprob/Minimum Equivalent Digraph
  228. Hardprob/Minimum Exact Cover
  229. Hardprob/Minimum Facility Location
  230. Hardprob/Minimum Feedback Arc Set
  231. Hardprob/Minimum Feedback Vertex Set
  232. Hardprob/Minimum File Transfer Scheduling
  233. Hardprob/Minimum Flow-Shop Scheduling
  234. Hardprob/Minimum General Routing
  235. Hardprob/Minimum Generalized 0-1 Assignment
  236. Hardprob/Minimum Generalized Steiner Network
  237. Hardprob/Minimum Geometric 3-Degree Spanning Tree
  238. Hardprob/Minimum Geometric Disk Cover
  239. Hardprob/Minimum Geometric Steiner Tree
  240. Hardprob/Minimum Geometric Traveling Salesperson
  241. Hardprob/Minimum Graph Coloring
  242. Hardprob/Minimum Graph Inference
  243. Hardprob/Minimum Graph Motion Planning
  244. Hardprob/Minimum Graph Transformation
  245. Hardprob/Minimum Height Two Dimensional Packing
  246. Hardprob/Minimum Hitting Set
  247. Hardprob/Minimum Independent Dominating Set
  248. Hardprob/Minimum Interval Graph Completion
  249. Hardprob/Minimum Job Shop Scheduling
  250. Hardprob/Minimum K-Capacitated Tree Partition

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

Источник — «https://discopal.ispras.ru/Служебная:Без_интервики»