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 821–830 of 1277 papers

TitleStatusHype
Deep Learning based Antenna Selection and CSI Extrapolation in Massive MIMO Systems—0
Learning DNN networks using un-rectifying ReLU with compressed sensing application—0
Active Screening for Recurrent Diseases: A Reinforcement Learning Approach—0
Learning General Policies from Small Examples Without SupervisionCode0
Dynamic Feature Selection for Efficient and Interpretable Human Activity Recognition—0
Learning to Make Decisions via Submodular Regularization—0
Learning to Solve Multi-Robot Task Allocation with a Covariant-Attention based Neural Architecture—0
ScheduleNet: Learn to Solve MinMax mTSP Using Reinforcement Learning with Delayed Reward—0
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation—0
Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation—0
Show:102550
← PrevPage 83 of 128Next →

No leaderboard results yet.