SOTAVerified

Combinatorial Optimization

Combinatorial Optimization is a category of problems which requires optimizing a function over a combination of discrete objects and the solutions are constrained. Examples include finding shortest paths in a graph, maximizing value in the Knapsack problem and finding boolean settings that satisfy a set of constraints. Many of these problems are NP-Hard, which means that no polynomial time solution can be developed for them. Instead, we can only produce approximations in polynomial time that are guaranteed to be some factor worse than the true optimal solution.

Source: Recent Advances in Neural Program Synthesis

Papers

Showing 76100 of 1277 papers

TitleStatusHype
Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time WindowsCode1
Combinatorial Optimization Perspective based Framework for Multi-behavior RecommendationCode1
Combinatorial Optimization with Policy Adaptation using Latent Space SearchCode1
A Bayesian algorithm for retrosynthesisCode1
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman ProblemCode1
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent setCode1
D2Match: Leveraging Deep Learning and Degeneracy for Subgraph MatchingCode1
DeepACO: Neural-enhanced Ant Systems for Combinatorial OptimizationCode1
Deep Boltzmann Machines in Estimation of Distribution Algorithms for Combinatorial OptimizationCode1
Automatic Truss Design with Reinforcement LearningCode1
Deep Graph Matching via Blackbox Differentiation of Combinatorial SolversCode1
Active Learning Meets Optimized Item SelectionCode1
A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock PredictionCode1
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with DroneCode1
DIMES: A Differentiable Meta Solver for Combinatorial Optimization ProblemsCode1
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial OptimizationCode1
Attention, Learn to Solve Routing Problems!Code1
ASP: Learn a Universal Neural Solver!Code1
Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization SolversCode1
An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint ProgrammingCode1
Quantum approximate optimization via learning-based adaptive optimizationCode1
Exploring the Power of Graph Neural Networks in Solving Linear Optimization ProblemsCode1
Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization AlgorithmsCode1
A Two-stage Reinforcement Learning-based Approach for Multi-entity Task AllocationCode1
A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock PredictionsCode1
Show:102550
← PrevPage 4 of 52Next →

No leaderboard results yet.