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 1101–1150 of 1277 papers

TitleStatusHype
NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree ProblemsCode0
Submodular Batch Selection for Training Deep Neural NetworksCode0
Deep Learning Chromatic and Clique Numbers of GraphsCode0
Learning Geometric Combinatorial Optimization Problems using Self-attention and Domain KnowledgeCode0
Efficient Combinatorial Optimization via Heat DiffusionCode0
Self-Adaptive Ising Machines for Constrained OptimizationCode0
WardropNet: Traffic Flow Predictions via Equilibrium-Augmented LearningCode0
Self-averaging of digital memcomputing machinesCode0
Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial OptimizationCode0
Deep Learning as a Mixed Convex-Combinatorial Optimization ProblemCode0
The (Un)Scalability of Heuristic Approximators for NP-Hard Search ProblemsCode0
USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization ProblemsCode0
Learning General Policies from Small Examples Without SupervisionCode0
Structural Causal Models Reveal Confounder Bias in Linear Program ModellingCode0
LeadCache: Regret-Optimal Caching in NetworksCode0
Learning Heuristics over Large Graphs via Deep Reinforcement LearningCode0
Interferometric Neural NetworksCode0
Graph Neural Networks for the Offline Nanosatellite Task Scheduling ProblemCode0
Blackout DIFUSCOCode0
Intelligent Channel Allocation for IEEE 802.11be Multi-Link Operation: When MAB Meets LLMCode0
Sub-universal variational circuits for combinatorial optimization problemsCode0
Decision-Focused Learning to Predict Action Costs for PlanningCode0
Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instancesCode0
Pruning Edges and Gradients to Learn Hypergraphs from Larger SetsCode0
Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing SolverCode0
Injecting Combinatorial Optimization into MCTS: Application to the Board Game boopCode0
Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization ProblemsCode0
Budget-Aware Sequential Brick Assembly with Efficient Constraint SatisfactionCode0
Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement LearningCode0
Offline Reinforcement Learning for Learning to Dispatch for Job Shop SchedulingCode0
A Formal Perspective on Byte-Pair EncodingCode0
Diversity-Driven View Subset Selection for Indoor Novel View SynthesisCode0
DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean OptimizationCode0
Regret in Online Combinatorial OptimizationCode0
A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial OptimizationCode0
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint SatisfactionCode0
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial ProblemsCode0
Ecole: A Library for Learning Inside MILP SolversCode0
Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic ModelsCode0
Regularized Langevin Dynamics for Combinatorial OptimizationCode0
Learning to Remove Cuts in Integer Linear ProgrammingCode0
Reheated Gradient-based Discrete Sampling for Combinatorial OptimizationCode0
Differentiable Quadratic Optimization For The Maximum Independent Set ProblemCode0
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and ApplicationsCode0
Automated quantum programming via reinforcement learning for combinatorial optimizationCode0
Reinforcement Learning Assisted Recursive QAOACode0
Reinforcement Learning-based Heuristics to Guide Domain-Independent Dynamic ProgrammingCode0
Attack Graph ObfuscationCode0
Curriculum learning for multilevel budgeted combinatorial problemsCode0
Implementing a GPU-based parallel MAX-MIN Ant SystemCode0
Show:102550
← PrevPage 23 of 26Next →

No leaderboard results yet.