Все страницы
Материал из DISCOPAL
| Все страницы |
- 0x1-classification
- 2-Выполнимость
- 2011-02-22
- 2011-09-15
- 2011-09-22
- 2011-09-25
- 2011-09-29
- 2011-10-13
- 2011-10-20
- 2011-10-27
- 2011-11-09
- 2011-12-08
- 2012-12-19
- 2SAT
- 2SAT:Решение
- 3-Выполнимость
- 3ESAT
- 3SAT
- 3КНФ→Клика Решение Иваничкина
- A
- Advanced-algorithms
- Advanced Algorithms/2020-12-01 Feedback
- Advanced Algorithms/2020-12-15 Feedback
- Advanced Algorithms/2021-03-11
- Arxiv/A Matheuristic for the Electric Vehicle Routing Problem with Time Windows 2015 1506.00211
- Arxiv/A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW 2015 1502.01972
- Arxiv/A PTAS for Capacitated Vehicle Routing on Trees 2021 2111.03735
- Arxiv/A Quantum Annealing Approach to Reduce Covid-19 Spread on College Campuses 2021 2112.01220
- Arxiv/A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem 2014 1409.5166
- Arxiv/A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem 2020 2012.11021
- Arxiv/An Adaptive Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem 2021 2111.12821
- Arxiv/An Empirical Investigation of Four Well-Known Polynomial-Size VRP Formulations 2018 1810.00199
- Arxiv/Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension 2021 2106.15034
- Arxiv/Approximation in (Poly-) Logarithmic Space 2020 2008.04416
- Arxiv/Capacitated Vehicle Routing with Target Geometric Constraints 2021 2107.10382
- Arxiv/Comparison of Randomized Solutions for Constrained Vehicle Routing Problem 2020 2005.05871
- Arxiv/Complex Vehicle Routing with Memory Augmented Neural Networks 2020 2009.10520
- Arxiv/Data Driven VRP — A Neural Network Model to Learn Hidden Preferences for VRP 2021 2108.04578
- Arxiv/Decentralized Personalized Federated Min-Max Problems 2021 2106.07289
- Arxiv/Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem 2021 2110.02629
- Arxiv/Distributed Saddle-Point Problems Under Similarity 2021 2107.10706
- Arxiv/Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information 2021 2109.05198
- Arxiv/Fast Approximate Solutions using Reinforcement Learning for Dynamic Capacitated Vehicle Routing with Time Windows 2021 2102.12088
- Arxiv/Heuristic Rectangle Splitting — Leveraging Single-Objective Heuristics to Efficiently Solve Multi-Objective Problems 2017 1705.10174
- Arxiv/Heuristics for vehicle routing problems — Sequence or set optimization? 2018 1803.06062
- Arxiv/Improved Approximations for CVRP with Unsplittable Demands 2021 2111.08138
- Arxiv/Incentive-aware Electric Vehicle Routing Problem — a Bi-level Model and a Joint Solution Algorithm 2021 2110.06441
- Arxiv/Integrating Fuzzy and Ant Colony System for Fuzzy Vehicle Routing Problem with Time Windows 2014 1411.3806
- Arxiv/Learning (Re-)Starting Solutions for Vehicle Routing Problems 2020 2008.03424
- Arxiv/Learning Collaborative Policies to Solve NP-hard Routing Problems 2021 2110.13987
- Arxiv/Learning Enhanced Optimisation for Routing Problems 2021 2109.08345
- Arxiv/Learning Improvement Heuristics for Solving Routing Problems 2020 1912.05784
- Arxiv/Learning Vehicle Routing Problems using Policy Optimisation 2020 2012.13269
- Arxiv/Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer 2021 2110.02544
- Arxiv/Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem 2020 1911.09539
- Arxiv/NeuroLKH — Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem 2021 2110.07983
- Arxiv/On the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking 2020 2005.05066
- Arxiv/Online Food Delivery to Minimize Maximum Flow Time 2021 2110.15772
- Arxiv/POMO — Policy Optimization with Multiple Optima for Reinforcement Learning 2020 2010.16011
- Arxiv/Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times 2019 1902.03930
- Arxiv/RP-DQN — An application of Q-Learning to Vehicle Routing Problems 2021 2104.12226
- Arxiv/Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing 2020 2010.12001
- Arxiv/Route Optimization via Environment-Aware Deep Network and Reinforcement Learning 2021 2111.09124
- Arxiv/Solve routing problems with a residual edge-graph attention neural network 2021 2105.02730
- Arxiv/Solving Area Coverage Problem with UAVs — A Vehicle Routing with Time Windows Variation 2020 2003.07124
- Arxiv/The fragility-constrained vehicle routing problem with time windows 2021 2109.01883
- Arxiv/The vehicle routing problem with drones and drone speed selection 2021 2111.13050
- Arxiv/Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP 2021 2102.00567
- Arxiv/Vehicle Routing Problem with Time Windows — A Deterministic Annealing approach 2016 1604.03590
- Arxiv/dMFEA-II — An Adaptive Multifactorial Evolutionary Algorithm for Permutation-based Discrete Optimization Problems 2020 2004.06559
- BPP
- BPP in PSPACE Решение Рубановой
- Blockchain-research
- Business-modeling-pyomo
- Chefstr2.py
- Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
- Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
- Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
- Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
- Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
- Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
- Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
- Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
- Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
- Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
- Citeseer/Bandits with knapsacks (2013) 10.1.1.744.7353
- Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
- 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
- Citeseer/Convexity and solutions of stochastic Multidimensional Knapsack Problems with Probabilistic Constraints (2012) 10.1.1.258.3304
- Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
- Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
- Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
- Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
- Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
- Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
- Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
- Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
- Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
- Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
- Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
- Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
- Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
- Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
- Climbing stairs
- CoNP
- CoRP
- Cocalc on Fedora
- Coq
- Course-3y-ispras
- Courses
- Crypto
- Crystofides
- DSPACE
- DTIME
- Determinant Решение Рубановой
- Digprime.py
- Diplom-tunev
- Discovering leaders from community actions (Bonchi, Lakshmanan)
- Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
- DocMarking/TestCases
- DocMarking/Алгоритмы
- DocStruct
- DocStruct/ToDo
- Dynamic Group Detection/Datasets
- Dynamic Group Detection/Datasets/Last.fm with friends/Similarity/Notes
- Dynamic Voltage Scaling Решение Рубановой
- EXPTIME
- Elearning-proposal
- En.book-advanced-algorithms.htm
- En.contacts.htm
- En.cs-isp-sbornik-1.htm
- En.cs-isp-sbornik-2006-05.htm
- En.cs-isp-sbornik-2006-12.htm
- En.cs-isp-sborniks.htm
- En.index.htm
- En.isp-guidelines.htm
- En.lectures-lattice-based-cryptography.htm
- En.lectures-mipt.htm
- En.lectures.htm
- En.network cover.htm
- En.nnkuzbib.htm
- En.plpapx.htm
- Euclidean Max Cut
- Everyones an influencer. quantifying influence on twitter (Bakshy, Hofman, Mason, Watts, 2011)
- Evvnes/Solutions
- Ex-breath-tree-for-vertex-covering-1-2 Решение Иваничкина
- Ex-dijksta-not-work-on-negative-weight Решение Иваничкина
- Ex-sat-average-expect-max-nk Решение Рубановой
- Exersize-greedy-covering-1/Сандуляну Любовь
- Exersize-greedy-covering-1 Сандуляну Любовь
- Fibo-fragment-cpp
- GRE-CS-v01