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 126–150 of 1277 papers

TitleStatusHype
Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization—0
Pareto Optimization with Robust Evaluation for Noisy Subset Selection—0
Annealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization—0
Self-Adaptive Ising Machines for Constrained OptimizationCode0
Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer—0
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization—0
Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization—0
Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model Training—0
Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem—0
Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex NetworkCode2
Scalable Quantum-Inspired Optimization through Dynamic Qubit Compression—0
On Enhancing Network Throughput using Reinforcement Learning in Sliced Testbeds—0
Multi Agent Reinforcement Learning for Sequential Satellite Assignment ProblemsCode1
HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMsCode1
Multi-task Representation Learning for Mixed Integer Linear ProgrammingCode0
Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming ProblemCode1
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling ProblemsCode1
LLMs for Cold-Start Cutting Plane Separator ConfigurationCode0
Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks—0
Brain-inspired Chaotic Graph Backpropagation for Large-scale Combinatorial Optimization—0
Scaling Combinatorial Optimization Neural Improvement Heuristics with Online Search and Adaptation—0
DistrictNet: Decision-aware learning for geographical districtingCode0
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence ModelCode0
XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference—0
SizeGS: Size-aware Compression of 3D Gaussians with Hierarchical Mixed Precision Quantization—0
Show:102550
← PrevPage 6 of 52Next →

No leaderboard results yet.