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 441–450 of 1277 papers

TitleStatusHype
Fewer Truncations Improve Language Modeling—0
Proposed modified computational model for the amoeba-inspired combinatorial optimization machine—0
Generative Pre-Trained Transformer for Symbolic Regression Base In-Context Reinforcement Learning—0
Message Passing Variational Autoregressive Network for Solving Intractable Ising Models—0
Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective—0
Transform then Explore: a Simple and Effective Technique for Exploratory Combinatorial Optimization with Reinforcement Learning—0
Mining Potentially Explanatory Patterns via Partial SolutionsCode0
Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks—0
Deep Reinforcement Learning for Traveling Purchaser Problems—0
Solving the QAP by Two-Stage Graph Pointer Networks and Reinforcement Learning—0
Show:102550
← PrevPage 45 of 128Next →

No leaderboard results yet.