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

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

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

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

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