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 601–625 of 1277 papers

TitleStatusHype
Directed percolation and numerical stability of simulations of digital memcomputing machines—0
Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions—0
A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Meme Stock Prediction—0
An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems—0
A Weighted Common Subgraph Matching Algorithm—0
Diffusion-Inspired Quantum Noise Mitigation in Parameterized Quantum Circuits—0
DIFFRAC: a discriminative and flexible framework for clustering—0
Auxiliary-task Based Deep Reinforcement Learning for Participant Selection Problem in Mobile Crowdsourcing—0
An Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles—0
Differentially Private Partial Set Cover with Applications to Facility Location—0
Differentiable Scaffolding Tree for Molecule Optimization—0
Differentiable Scaffolding Tree for Molecular Optimization—0
Automatic Rank Selection for High-Speed Convolutional Neural Network—0
An Approximation Algorithm for Risk-averse Submodular Optimization—0
Accelerating Exact Combinatorial Optimization via RL-based Initialization -- A Case Study in Scheduling—0
A Bayesian approach for prompt optimization in pre-trained language models—0
Differentiable Greedy Networks—0
Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem—0
Detecting Overlapping Temporal Community Structure in Time-Evolving Networks—0
Automatic Loss Function Search for Predict-Then-Optimize Problems with Strong Ranking Property—0
Design Space Exploration as Quantified Satisfaction—0
Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization—0
Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations—0
Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint—0
Density Maximization in Context-Sense Metric Space for All-words WSD—0
Show:102550
← PrevPage 25 of 52Next →

No leaderboard results yet.