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 801–825 of 1277 papers

TitleStatusHype
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems—0
Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems—0
quantum Case-Based Reasoning (qCBR)—0
Greedy-Based Feature Selection for Efficient LiDAR SLAM—0
Leveraging Conflicting Constraints in Solving Vehicle Routing Problems—0
A Two-stage Framework and Reinforcement Learning-based Optimization Algorithms for Complex Scheduling Problems—0
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise ConstraintsCode0
Knowledge engineering mixed-integer linear programming: constraint typology—0
Combinatorial optimization and reasoning with graph neural networks—0
SeaPearl: A Constraint Programming Solver guided by Reinforcement LearningCode1
A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy—0
Reversible Action Design for Combinatorial Optimization with Reinforcement Learning—0
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation—0
Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems—0
Directed percolation and numerical stability of simulations of digital memcomputing machines—0
Zero Training Overhead Portfolios for Learning to Solve Combinatorial Problems—0
Particle Swarm Optimization: Fundamental Study and its Application to Optimization and to Jetty Scheduling Problems—0
Noisy intermediate-scale quantum (NISQ) algorithms—0
mRNA Codon Optimization on Quantum Comptuers—0
ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search SpacesCode0
Deep Learning based Antenna Selection and CSI Extrapolation in Massive MIMO Systems—0
Learning DNN networks using un-rectifying ReLU with compressed sensing application—0
Active Screening for Recurrent Diseases: A Reinforcement Learning Approach—0
Learning General Policies from Small Examples Without SupervisionCode0
Dynamic Feature Selection for Efficient and Interpretable Human Activity Recognition—0
Show:102550
← PrevPage 33 of 52Next →

No leaderboard results yet.