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

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

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

Префикс  

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

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

  1. Arxiv/Solve routing problems with a residual edge-graph attention neural network 2021 2105.02730
  2. Arxiv/Solving Area Coverage Problem with UAVs — A Vehicle Routing with Time Windows Variation 2020 2003.07124
  3. Arxiv/The fragility-constrained vehicle routing problem with time windows 2021 2109.01883
  4. Arxiv/The vehicle routing problem with drones and drone speed selection 2021 2111.13050
  5. Arxiv/Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP 2021 2102.00567
  6. Arxiv/Vehicle Routing Problem with Time Windows — A Deterministic Annealing approach 2016 1604.03590
  7. Arxiv/dMFEA-II — An Adaptive Multifactorial Evolutionary Algorithm for Permutation-based Discrete Optimization Problems 2020 2004.06559
  8. BPP
  9. Blockchain-research
  10. Chefstr2.py
  11. Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
  12. Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
  13. Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
  14. Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
  15. Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
  16. Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
  17. Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
  18. Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
  19. Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
  20. Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
  21. Citeseer/Bandits with knapsacks (2013) 10.1.1.744.7353
  22. Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
  23. 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
  24. Citeseer/Convexity and solutions of stochastic Multidimensional Knapsack Problems with Probabilistic Constraints (2012) 10.1.1.258.3304
  25. Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
  26. Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
  27. Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
  28. Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
  29. Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
  30. Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
  31. Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
  32. Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
  33. Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
  34. Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
  35. Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
  36. Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
  37. Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
  38. Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
  39. Climbing stairs
  40. CoNP
  41. CoRP
  42. Cocalc on Fedora
  43. Coq
  44. Courses
  45. DSPACE
  46. DTIME
  47. Digprime.py
  48. Diplom-tunev
  49. Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
  50. DocMarking/Алгоритмы
  51. DocStruct
  52. EXPTIME
  53. En.book-advanced-algorithms.htm
  54. En.contacts.htm
  55. En.cs-isp-sbornik-1.htm
  56. En.cs-isp-sbornik-2006-05.htm
  57. En.cs-isp-sbornik-2006-12.htm
  58. En.cs-isp-sborniks.htm
  59. En.index.htm
  60. En.isp-guidelines.htm
  61. En.lectures-lattice-based-cryptography.htm
  62. En.lectures-mipt.htm
  63. En.lectures.htm
  64. En.network cover.htm
  65. En.nnkuzbib.htm
  66. En.plpapx.htm
  67. Everyones an influencer. quantifying influence on twitter (Bakshy, Hofman, Mason, Watts, 2011)
  68. Fibo-fragment-cpp
  69. GRE-CS-v01
  70. Geome try/codechef ENC2020F
  71. Geome try/codechef KAN13F
  72. Geome try/codechef MCO16204
  73. Greedy algorithm for SAT
  74. Hardprob/Longest Common Subsequence
  75. Hardprob/Longest Computation
  76. Hardprob/Longest Path
  77. Hardprob/Longest Path With Forbidden Pairs
  78. Hardprob/Maximum 3-Dimensional Matching
  79. Hardprob/Maximum Achromatic Number
  80. Hardprob/Maximum Balanced Connected Partition
  81. Hardprob/Maximum Bounded 0-1 Programming
  82. Hardprob/Maximum Capacity Representatives
  83. Hardprob/Maximum Class-Constrained Knapsack
  84. Hardprob/Maximum Clique
  85. Hardprob/Maximum Common Embedded Sub-Tree
  86. Hardprob/Maximum Common Induced Subgraph
  87. Hardprob/Maximum Common Point Set
  88. Hardprob/Maximum Common Subgraph
  89. Hardprob/Maximum Common Subtree
  90. Hardprob/Maximum Constrained Partition
  91. Hardprob/Maximum Constrained Sequencing To Minimize Tardy Task Weight
  92. Hardprob/Maximum Cut
  93. Hardprob/Maximum D-Vector Covering
  94. Hardprob/Maximum Degree Bounded Connected Subgraph
  95. Hardprob/Maximum Directed Cut
  96. Hardprob/Maximum Disjoint Connecting Paths
  97. Hardprob/Maximum Distinguished Ones
  98. Hardprob/Maximum Domatic Partition
  99. Hardprob/Maximum Edge Subgraph
  100. Hardprob/Maximum H-Matching
  101. Hardprob/Maximum Horn Core
  102. Hardprob/Maximum Hyperplane Consistency
  103. Hardprob/Maximum Independent Sequence
  104. Hardprob/Maximum Independent Set
  105. Hardprob/Maximum Induced Connected Subgraph With Property P
  106. Hardprob/Maximum Induced Subgraph With Property P
  107. Hardprob/Maximum Integer K-Choice Knapsack
  108. Hardprob/Maximum Integer M-Dimensional Knapsack
  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 K-Satisfiability
  117. Hardprob/Maximum Knapsack
  118. Hardprob/Maximum Leaf Spanning Tree
  119. Hardprob/Maximum Minimum Metric K-Spanning Tree
  120. Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
  121. Hardprob/Maximum Not-All-Equal 3-Satisfiability
  122. Hardprob/Maximum Number Of Satisfiable Formulas
  123. Hardprob/Maximum Packing Integer Programming
  124. Hardprob/Maximum Planar Subgraph
  125. Hardprob/Maximum Priority Flow
  126. Hardprob/Maximum Quadratic Assignment
  127. Hardprob/Maximum Quadratic Programming
  128. Hardprob/Maximum Renamable Horn Subformula
  129. Hardprob/Maximum Satisfiability
  130. Hardprob/Maximum Satisfiability Of Quadratic Equations Over Gf(Q)
  131. Hardprob/Maximum Satisfying Linear Subsystem
  132. Hardprob/Maximum Set Packing
  133. Hardprob/Maximum Set Splitting
  134. Hardprob/Maximum Subforest
  135. Hardprob/Maximum Triangle Packing
  136. Hardprob/Maximum Weighted Satisfiability With Bound
  137. Hardprob/Minimum 0-1 Programming
  138. Hardprob/Minimum 3-Dedicated Processor Scheduling
  139. Hardprob/Minimum 3-Dimensional Assignment
  140. Hardprob/Minimum 3-Dnf Satisfiability
  141. Hardprob/Minimum Array Partition
  142. Hardprob/Minimum B-Balanced Cut
  143. Hardprob/Minimum B-Vertex Separator
  144. Hardprob/Minimum Bandwidth
  145. Hardprob/Minimum Bend Number
  146. Hardprob/Minimum Biconnectivity Augmentation
  147. Hardprob/Minimum Bin Packing
  148. Hardprob/Minimum Block-Angular Convex Programming
  149. Hardprob/Minimum Bottleneck Path Matching
  150. Hardprob/Minimum Bounded Diameter Augmentation
  151. Hardprob/Minimum Broadcast Time
  152. Hardprob/Minimum Chinese Postman For Mixed Graphs
  153. Hardprob/Minimum Chordal Graph Completion
  154. Hardprob/Minimum Clique Cover
  155. Hardprob/Minimum Clique Partition
  156. Hardprob/Minimum Color Sum
  157. Hardprob/Minimum Communication Cost Spanning Tree
  158. Hardprob/Minimum Complete Bipartite Subgraph Cover
  159. Hardprob/Minimum Consistent Finite Automaton
  160. Hardprob/Minimum Covering Integer Programming
  161. Hardprob/Minimum Crossing Number
  162. Hardprob/Minimum Cut Cover
  163. Hardprob/Minimum Cut Linear Arrangement
  164. Hardprob/Minimum Degree Spanning Tree
  165. Hardprob/Minimum Diameter Spanning Subgraph
  166. Hardprob/Minimum Diameters Decomposition
  167. Hardprob/Minimum Directed Bandwidth
  168. Hardprob/Minimum Distinguished Ones
  169. Hardprob/Minimum Dominating Set
  170. Hardprob/Minimum Dynamic Storage Allocation
  171. Hardprob/Minimum Edge Coloring
  172. Hardprob/Minimum Edge Deletion K-Partition
  173. Hardprob/Minimum Edge Deletion To Obtain Subgraph With Property P
  174. Hardprob/Minimum Edge Dominating Set
  175. Hardprob/Minimum Edge K-Spanner
  176. Hardprob/Minimum Equivalence Deletion
  177. Hardprob/Minimum Equivalent Digraph
  178. Hardprob/Minimum Exact Cover
  179. Hardprob/Minimum Facility Location
  180. Hardprob/Minimum Feedback Arc Set
  181. Hardprob/Minimum Feedback Vertex Set
  182. Hardprob/Minimum File Transfer Scheduling
  183. Hardprob/Minimum Flow-Shop Scheduling
  184. Hardprob/Minimum General Routing
  185. Hardprob/Minimum Generalized 0-1 Assignment
  186. Hardprob/Minimum Generalized Steiner Network
  187. Hardprob/Minimum Geometric 3-Degree Spanning Tree
  188. Hardprob/Minimum Geometric Disk Cover
  189. Hardprob/Minimum Geometric Steiner Tree
  190. Hardprob/Minimum Geometric Traveling Salesperson
  191. Hardprob/Minimum Graph Coloring
  192. Hardprob/Minimum Graph Inference
  193. Hardprob/Minimum Graph Motion Planning
  194. Hardprob/Minimum Graph Transformation
  195. Hardprob/Minimum Height Two Dimensional Packing
  196. Hardprob/Minimum Hitting Set
  197. Hardprob/Minimum Independent Dominating Set
  198. Hardprob/Minimum Interval Graph Completion
  199. Hardprob/Minimum Job Shop Scheduling
  200. Hardprob/Minimum K-Capacitated Tree Partition
  201. Hardprob/Minimum K-Center
  202. Hardprob/Minimum K-Clustering
  203. Hardprob/Minimum K-Clustering Sum
  204. Hardprob/Minimum K-Cut
  205. Hardprob/Minimum K-Edge Connected Subgraph
  206. Hardprob/Minimum K-Median
  207. Hardprob/Minimum K-Satisfiability
  208. Hardprob/Minimum K-Spanning Tree
  209. Hardprob/Minimum K-Stacker Crane Problem
  210. Hardprob/Minimum K-Supplier
  211. Hardprob/Minimum K-Switching Network
  212. Hardprob/Minimum K-Vertex Connected Subgraph
  213. Hardprob/Minimum Length Equivalent Frege Proof
  214. Hardprob/Minimum Length Triangulation
  215. Hardprob/Minimum Linear Arrangement
  216. Hardprob/Minimum Local Register Allocation
  217. Hardprob/Minimum Locally Testable Automaton Order
  218. Hardprob/Minimum Maximal Matching
  219. Hardprob/Minimum Maximum Disjoint Connecting Paths
  220. Hardprob/Minimum Metric Bottleneck Wandering Salesperson Problem
  221. Hardprob/Minimum Metric Dimension
  222. Hardprob/Minimum Metric Traveling K-Salesperson Problem
  223. Hardprob/Minimum Metric Traveling Salesperson Problem
  224. Hardprob/Minimum Multi Cut
  225. Hardprob/Minimum Multiprocessor Scheduling
  226. Hardprob/Minimum Multiprocessor Scheduling With Speed Factors
  227. Hardprob/Minimum Multiway Cut
  228. Hardprob/Minimum Network Inhibition On Planar Graphs
  229. Hardprob/Minimum Number Of Satisfiable Formulas
  230. Hardprob/Minimum Open-Shop Scheduling
  231. Hardprob/Minimum Parallel Processor Total Flow Time
  232. Hardprob/Minimum Permutation Group Base
  233. Hardprob/Minimum Planar Record Packing
  234. Hardprob/Minimum Point-To-Point Connection
  235. Hardprob/Minimum Precedence Constrained Scheduling
  236. Hardprob/Minimum Precedence Constrained Sequencing With Delays
  237. Hardprob/Minimum Preemptive Scheduling With Set-Up Times
  238. Hardprob/Minimum Quadratic 0-1 Assignment
  239. Hardprob/Minimum Quotient Cut
  240. Hardprob/Minimum Ratio-Cut
  241. Hardprob/Minimum Rectangle Cover
  242. Hardprob/Minimum Rectangle Tiling
  243. Hardprob/Minimum Rectilinear Global Routing
  244. Hardprob/Minimum Register Sufficiency
  245. Hardprob/Minimum Relevant Variables In Linear System
  246. Hardprob/Minimum Resource Constrained Scheduling
  247. Hardprob/Minimum Routing Tree Congestion
  248. Hardprob/Minimum Schedule Length
  249. Hardprob/Minimum Separating Subdivision
  250. Hardprob/Minimum Sequencing With Release Times

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

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