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 826–850 of 1277 papers

TitleStatusHype
XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference—0
XPrompt:Explaining Large Language Model's Generation via Joint Prompt Attribution—0
YaoGAN: Learning Worst-case Competitive Algorithms from Self-generated Inputs—0
Yordle: An Efficient Imitation Learning for Branch and Bound—0
Robust Metric Learning by Smooth Optimization—0
Large Language Models Can Solve Real-World Planning Rigorously with Formal Verification Tools—0
Large Language Models for Combinatorial Optimization of Design Structure Matrix—0
Large Language Models for Combinatorial Optimization: A Systematic Review—0
Large Language Models for Design Structure Matrix Optimization—0
Large Language Models for Supply Chain Optimization—0
Large Scale Constrained Clustering With Reinforcement Learning—0
Large Scale Diverse Combinatorial Optimization: ESPN Fantasy Football Player Trades—0
Large-scale Urban Facility Location Selection with Knowledge-informed Reinforcement Learning—0
Lattice Protein Folding with Variational Annealing—0
LayerNAS: Neural Architecture Search in Polynomial Complexity—0
Leader Reward for POMO-Based Neural Combinatorial Optimization—0
Learning Adaptive Evolutionary Computation for Solving Multi-Objective Optimization Problems—0
Learning-based Compressive Subsampling—0
Learning-based Measurement Scheduling for Loosely-Coupled Cooperative Localization—0
Learning-based Memetic Algorithm for Hard-label Textual Attack—0
Learning-Based TSP-Solvers Tend to Be Overly Greedy—0
Learning Branching Heuristics from Graph Neural Networks—0
Learning chordal extensions—0
Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking—0
Learning Combinatorial Solver for Graph Matching—0
Show:102550
← PrevPage 34 of 52Next →

No leaderboard results yet.