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 401–425 of 1277 papers

TitleStatusHype
Combinatorial Topic Models using Small-Variance Asymptotics—0
Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks—0
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation—0
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection—0
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing—0
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)—0
Combinatorial Optimization via LLM-driven Iterated Fine-tuning—0
Combinatorial optimization solving by coherent Ising machines based on spiking neural networks—0
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover—0
Combinatorial optimization for low bit-width neural networks—0
Ant Colony Optimization and Hypergraph Covering Problems—0
A Generative Neural Annealer for Black-Box Combinatorial Optimization—0
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem—0
Combinatorial Optimization for All: Using LLMs to Aid Non-Experts in Improving Optimization Algorithms—0
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem—0
Combinatorial optimization and reasoning with graph neural networks—0
An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem—0
A Generative Graph Method to Solve the Travelling Salesman Problem—0
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards—0
Differentiable Combinatorial Losses through Generalized Gradients of Linear Programs—0
Combinatorial Keyword Recommendations for Sponsored Search with Deep Reinforcement Learning—0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning—0
Show:102550
← PrevPage 17 of 52Next →

No leaderboard results yet.