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
Boosting Ant Colony Optimization via Solution Prediction and Machine Learning—0
Boosting Combinatorial Problem Modeling with Machine Learning—0
Bottleneck potentials in Markov Random Fields—0
Brain-inspired Chaotic Graph Backpropagation for Large-scale Combinatorial Optimization—0
Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization—0
Budgeted Influence Maximization for Multiple Products—0
CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention—0
Cakewalk Sampling—0
Can We Learn Heuristics For Graphical Model Inference Using Reinforcement Learning?—0
Causal Effect Identification in Uncertain Causal Networks—0
Causal Discovery with Reinforcement Learning—0
CCJA: Context-Coherent Jailbreak Attack for Aligned Large Language Models—0
Chaos inspired Particle Swarm Optimization with Levy Flight for Genome Sequence Assembly—0
Characterization of Locality in Spin States and Forced Moves for Optimizations—0
Assessing Distribution Network Flexibility via Reliability-based P-Q Area Segmentation—0
Charged particle tracking with quantum annealing-inspired optimization—0
CHARME: A chain-based reinforcement learning approach for the minor embedding problem—0
Chases and Escapes, and Optimization Problems—0
Cheaper and Better: Selecting Good Workers for Crowdsourcing—0
Chemical Reaction Optimization for the Set Covering Problem—0
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions—0
Clustering Binary Data by Application of Combinatorial Optimization Heuristics—0
Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology—0
The Curious Case of Class Accuracy Imbalance in LLMs: Post-hoc Debiasing via Nonlinear Integer Programming—0
CoCo: Learning Strategies for Online Mixed-Integer Control—0
Show:102550
← PrevPage 42 of 52Next →

No leaderboard results yet.