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 251–275 of 1277 papers

TitleStatusHype
A Diffusion Model Framework for Unsupervised Neural Combinatorial OptimizationCode2
Diffusion-Inspired Quantum Noise Mitigation in Parameterized Quantum Circuits—0
Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with PerspectivesCode2
Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNsCode0
Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement—0
XPrompt:Explaining Large Language Model's Generation via Joint Prompt Attribution—0
A random-key GRASP for combinatorial optimizationCode0
Metaheuristics and Large Language Models Join Forces: Towards an Integrated Optimization Approach—0
Network Interdiction Goes Neural—0
Bayesian Optimization of Functions over Node Subsets in GraphsCode0
ProDAG: Projected Variational Inference for Directed Acyclic GraphsCode0
Randomized heuristic repair for large-scale multidimensional knapsack problem—0
Actively Learning Combinatorial Optimization Using a Membership Oracle—0
Leader Reward for POMO-Based Neural Combinatorial Optimization—0
Prompt Learning for Generalized Vehicle RoutingCode0
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set ProgrammingCode0
Submodular Information Selection for Hypothesis Testing with Misclassification Penalties—0
Using Combinatorial Optimization to Design a High quality LLM Solution—0
Cons-training Tensor Networks: Embedding and Optimization Over Discrete Linear ConstraintsCode0
Context-aware Diversity Enhancement for Neural Multi-Objective Combinatorial Optimization—0
Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and MoreCode1
The Curious Case of Class Accuracy Imbalance in LLMs: Post-hoc Debiasing via Nonlinear Integer Programming—0
Partial information decomposition: redundancy as information bottleneckCode0
Hamiltonian-based Quantum Reinforcement Learning for Neural Combinatorial Optimization—0
FloorSet -- a VLSI Floorplanning Dataset with Design Constraints of Real-World SoCsCode2
Show:102550
← PrevPage 11 of 52Next →

No leaderboard results yet.