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

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

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

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

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

  1. Arxiv/Heuristic Rectangle Splitting — Leveraging Single-Objective Heuristics to Efficiently Solve Multi-Objective Problems 2017 1705.10174
  2. Arxiv/Heuristics for vehicle routing problems — Sequence or set optimization? 2018 1803.06062
  3. Arxiv/Improved Approximations for CVRP with Unsplittable Demands 2021 2111.08138
  4. Arxiv/Incentive-aware Electric Vehicle Routing Problem — a Bi-level Model and a Joint Solution Algorithm 2021 2110.06441
  5. Arxiv/Integrating Fuzzy and Ant Colony System for Fuzzy Vehicle Routing Problem with Time Windows 2014 1411.3806
  6. Arxiv/Learning (Re-)Starting Solutions for Vehicle Routing Problems 2020 2008.03424
  7. Arxiv/Learning Collaborative Policies to Solve NP-hard Routing Problems 2021 2110.13987
  8. Arxiv/Learning Enhanced Optimisation for Routing Problems 2021 2109.08345
  9. Arxiv/Learning Improvement Heuristics for Solving Routing Problems 2020 1912.05784
  10. Arxiv/Learning Vehicle Routing Problems using Policy Optimisation 2020 2012.13269
  11. Arxiv/Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer 2021 2110.02544
  12. Arxiv/Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem 2020 1911.09539
  13. Arxiv/NeuroLKH — Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem 2021 2110.07983
  14. Arxiv/On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking 2020 2005.05066
  15. Arxiv/Online Food Delivery to Minimize Maximum Flow Time 2021 2110.15772
  16. Arxiv/POMO — Policy Optimization with Multiple Optima for Reinforcement Learning 2020 2010.16011
  17. Arxiv/Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times 2019 1902.03930
  18. Arxiv/RP-DQN — An application of Q-Learning to Vehicle Routing Problems 2021 2104.12226
  19. Arxiv/Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing 2020 2010.12001
  20. Arxiv/Route Optimization via Environment-Aware Deep Network and Reinforcement Learning 2021 2111.09124
  21. Arxiv/Solve routing problems with a residual edge-graph attention neural network 2021 2105.02730
  22. Arxiv/Solving Area Coverage Problem with UAVs — A Vehicle Routing with Time Windows Variation 2020 2003.07124
  23. Arxiv/The fragility-constrained vehicle routing problem with time windows 2021 2109.01883
  24. Arxiv/The vehicle routing problem with drones and drone speed selection 2021 2111.13050
  25. Arxiv/Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP 2021 2102.00567
  26. Arxiv/Vehicle Routing Problem with Time Windows — A Deterministic Annealing approach 2016 1604.03590
  27. Arxiv/dMFEA-II — An Adaptive Multifactorial Evolutionary Algorithm for Permutation-based Discrete Optimization Problems 2020 2004.06559
  28. Blockchain-research
  29. Chefstr2.py
  30. Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
  31. Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
  32. Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
  33. Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
  34. Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
  35. Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
  36. Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
  37. Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
  38. Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
  39. Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
  40. Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
  41. 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
  42. Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
  43. Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
  44. Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
  45. Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
  46. Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
  47. Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
  48. Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
  49. Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
  50. Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
  51. Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
  52. Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
  53. Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
  54. Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
  55. Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
  56. Climbing stairs
  57. Cocalc on Fedora
  58. Coq
  59. Digprime.py
  60. Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
  61. DocMarking/TestCases
  62. DocStruct
  63. DocStruct/ToDo
  64. Dynamic Group Detection/Datasets
  65. Dynamic Group Detection/Datasets/Last.fm with friends/Similarity/Notes
  66. En.contacts.htm
  67. En.cs-isp-sbornik-1.htm
  68. En.cs-isp-sbornik-2006-05.htm
  69. En.cs-isp-sbornik-2006-12.htm
  70. En.network cover.htm
  71. En.plpapx.htm
  72. Everyones an influencer. quantifying influence on twitter (Bakshy, Hofman, Mason, Watts, 2011)
  73. Fibo-fragment-cpp
  74. GRE-CS-v01
  75. Greedy algorithm for SAT
  76. Hardprob/Longest Computation
  77. Hardprob/Maximum Balanced Connected Partition
  78. Hardprob/Maximum Capacity Representatives
  79. Hardprob/Maximum Class-Constrained Knapsack
  80. Hardprob/Maximum Common Embedded Sub-Tree
  81. Hardprob/Maximum Common Induced Subgraph
  82. Hardprob/Maximum Common Point Set
  83. Hardprob/Maximum Common Subtree
  84. Hardprob/Maximum Distinguished Ones
  85. Hardprob/Maximum Edge Subgraph
  86. Hardprob/Maximum Horn Core
  87. Hardprob/Maximum Independent Sequence
  88. Hardprob/Maximum Integral K-Multicommodity Flow On Trees
  89. Hardprob/Maximum K-Colorable Induced Subgraph
  90. Hardprob/Maximum K-Colorable Subgraph
  91. Hardprob/Maximum K-Constraint Satisfaction
  92. Hardprob/Maximum K-Cut
  93. Hardprob/Maximum K-Facility Dispersion
  94. Hardprob/Maximum K-Facility Location
  95. Hardprob/Maximum Minimum Metric K-Spanning Tree
  96. Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
  97. Hardprob/Maximum Number Of Satisfiable Formulas
  98. Hardprob/Maximum Packing Integer Programming
  99. Hardprob/Maximum Priority Flow
  100. Hardprob/Maximum Quadratic Assignment

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

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