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

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

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

Просмотреть (предыдущие 50 | следующие 50) (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

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