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 1026–1050 of 1277 papers

TitleStatusHype
Reinforcement Learning with Chromatic Networks for Compact Architecture Search—0
A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice—0
Thompson Sampling for Combinatorial Network Optimization in Unknown Environments—0
Co-training for Policy LearningCode0
Convergence Rates of Smooth Message Passing with Rounding in Entropy-Regularized MAP Inference—0
Forecasting high-dimensional dynamics exploiting suboptimal embeddings—0
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction—0
Submodular Batch Selection for Training Deep Neural NetworksCode0
Reinforcement Learning Driven Heuristic Optimization—0
Curriculum Learning for Cumulative Return MaximizationCode0
Causal Discovery with Reinforcement Learning—0
Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem—0
Resolving Overlapping Convex Objects in Silhouette Images by Concavity Analysis and Gaussian Process—0
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
Two-Dimensional Phase Unwrapping via Balanced Spanning Forests—0
Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning—0
Solving NP-Hard Problems on Graphs with Extended AlphaGo ZeroCode0
Exact-K Recommendation via Maximal Clique OptimizationCode0
Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial OptimizationCode0
An LP-Based Approach for Goal Recognition as Planning—0
Design Space Exploration as Quantified Satisfaction—0
A new dog learns old tricks: RL finds classic optimization algorithms—0
Learning To Solve Circuit-SAT: An Unsupervised Differentiable Approach—0
Training Hard-Threshold Networks with Combinatorial Search in a Discrete Target Propagation Setting—0
The Cakewalk Method—0
Show:102550
← PrevPage 42 of 52Next →

No leaderboard results yet.