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 26–50 of 1277 papers

TitleStatusHype
Efficient Optimization Accelerator Framework for Multistate Ising Problems—0
RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models—0
Learning for Dynamic Combinatorial Optimization without Training Data—0
Structured Reinforcement Learning for Combinatorial Decision-MakingCode1
MOOSE-Chem2: Exploring LLM Limits in Fine-Grained Scientific Hypothesis Discovery via Hierarchical Search—0
Demand Selection for VRP with Emission QuotaCode0
LMask: Learn to Solve Constrained Routing Problems with Lazy Masking—0
STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization—0
Tropical Attention: Neural Algorithmic Reasoning for Combinatorial Algorithms—0
A Comprehensive Evaluation of Contemporary ML-Based Solvers for Combinatorial OptimizationCode1
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial OptimizationCode0
Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs—0
A Quantum-Enhanced Power Flow and Optimal Power Flow based on Combinatorial Reformulation—0
Neural Quantum Digital Twins for Optimizing Quantum Annealing—0
Normalized Cut with Reinforcement Learning in Constrained Action Space—0
Learning with Local Search MCMC Layers—0
Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language ModelsCode0
Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings—0
Quantum Computing and AI: Perspectives on Advanced Automation in Science and Engineering—0
XX^t Can Be FasterCode0
A Generative Neural Annealer for Black-Box Combinatorial Optimization—0
Preference Optimization for Combinatorial Optimization Problems—0
Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem—0
Lagrange Oscillatory Neural Networks for Constraint Satisfaction and OptimizationCode0
Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning—0
Show:102550
← PrevPage 2 of 52Next →

No leaderboard results yet.