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 931–940 of 1277 papers

TitleStatusHype
Metaheuristics and Large Language Models Join Forces: Towards an Integrated Optimization Approach—0
Métodos de Otimização Combinatória Aplicados ao Problema de Compressão MultiFrases—0
MindX: Denoising Mixed Impulse Poisson-Gaussian Noise Using Proximal Algorithms—0
A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs—0
MineReduce: an approach based on data mining for problem size reduction—0
Minimizing Energy Consumption in MU-MIMO via Antenna Muting by Neural Networks with Asymmetric Loss—0
Minimizing Polarization and Disagreement in Social Networks via Link Recommendation—0
Minimum Weight Perfect Matching via Blossom Belief Propagation—0
Mixed Uncertainty Sets for Robust Combinatorial Optimization—0
ML4CO: Is GCNN All You Need? Graph Convolutional Neural Networks Produce Strong Baselines For Combinatorial Optimization Problems, If Tuned and Trained Properly, on Appropriate Data—0
Show:102550
← PrevPage 94 of 128Next →

No leaderboard results yet.