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

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 851–860 of 1277 papers

TitleStatusHype
Learning Combined Set Covering and Traveling Salesman Problem—0
Learning Discrete Directed Acyclic Graphs via Backpropagation—0
Learning Distributions over Permutations and Rankings with Factorized Representations—0
Learning DNN networks using un-rectifying ReLU with compressed sensing application—0
Learning fine-grained search space pruning and heuristics for combinatorial optimization—0
Learning for Dynamic Combinatorial Optimization without Training Data—0
Learning for Robust Combinatorial Optimization: Algorithm and Application—0
Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs—0
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits—0
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations—0
Show:102550
← PrevPage 86 of 128Next →

No leaderboard results yet.