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 701–725 of 1277 papers

TitleStatusHype
Vulcan: Solving the Steiner Tree Problem with Graph Neural Networks and Deep Reinforcement Learning—0
MC-CIM: Compute-in-Memory with Monte-Carlo Dropouts for Bayesian Edge Intelligence—0
One model Packs Thousands of Items with Recurrent Conditional Query LearningCode1
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle—0
Large Scale Diverse Combinatorial Optimization: ESPN Fantasy Football Player Trades—0
Three-dimensional Cooperative Localization of Commercial-Off-The-Shelf Sensors—0
FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social NetworksCode0
Symbolic Regression via Neural-Guided Genetic Programming Population SeedingCode1
Sample Selection for Fair and Robust Training—0
Interpretable Decision Trees Through MaxSAT—0
Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness—0
OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit SynthesisCode1
Chaos inspired Particle Swarm Optimization with Levy Flight for Genome Sequence Assembly—0
RL4RS: A Real-World Dataset for Reinforcement Learning based Recommender SystemCode1
A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Meme Stock Prediction—0
Learning-based Memetic Algorithm for Hard-label Textual Attack—0
Robust Correlation Clustering with Asymmetric Noise—0
Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation AlgorithmCode0
Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum AnnealingCode0
Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method—0
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem—0
Hybrid Pointer Networks for Traveling Salesman Problems OptimizationCode1
Assessing Distribution Network Flexibility via Reliability-based P-Q Area Segmentation—0
Learning the Markov Decision Process in the Sparse Gaussian EliminationCode1
Learning to Solve an Order Fulfillment Problem in Milliseconds with Edge-Feature-Embedded Graph Attention—0
Show:102550
← PrevPage 29 of 52Next →

No leaderboard results yet.