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 626–650 of 1277 papers

TitleStatusHype
Quantum-Hybrid Stereo Matching With Nonlinear Regularization and Spatial Pyramids—0
Quantum-inspired annealers as Boltzmann generators for machine learning and statistical physics—0
Quantum-Inspired Machine Learning for Molecular Docking—0
Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization—0
QUBO transformation using Eigenvalue Decomposition—0
Quit When You Can: Efficient Evaluation of Ensembles with Ordering Optimization—0
Randomized heuristic repair for large-scale multidimensional knapsack problem—0
Random-Key Algorithms for Optimizing Integrated Operating Room Scheduling—0
Random-Key Cuckoo Search for the Travelling Salesman Problem—0
Real-time Crowd Tracking using Parameter Optimized Mixture of Motion Models—0
Real-World Airline Crew Pairing Optimization: Customized Genetic Algorithm versus Column Generation Method—0
Reasoning Algorithmically in Graph Neural Networks—0
Recent Advances in Deep Learning for Routing Problems—0
Recent Progress on Graph Partitioning Problems Using Evolutionary Computation—0
Recommendations for Marketing Campaigns in Telecommunication Business based on the footprint analysis—0
Reconstruction of Convex Polytope Compositions from 3D Point-clouds—0
Recursive Decomposition for Nonconvex Optimization—0
RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models—0
Redrawing attendance boundaries to promote racial and ethnic diversity in elementary schools—0
Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection—0
Regularized Greedy Column Subset Selection—0
Reinforcement Learning Approach for Multi-Agent Flexible Scheduling Problems—0
Reinforcement learning based local search for grouping problems: A case study on graph coloring—0
Reinforcement Learning Constrained Beam Search for Parameter Optimization of Paper Drying Under Flexible Constraints—0
Reinforcement Learning Driven Heuristic Optimization—0
Show:102550
← PrevPage 26 of 52Next →

No leaderboard results yet.