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 476–500 of 1277 papers

TitleStatusHype
Faster width-dependent algorithm for mixed packing and covering LPs—0
Combinatorial Optimization for All: Using LLMs to Aid Non-Experts in Improving Optimization Algorithms—0
Fast Hyperparameter Tuning for Ising Machines—0
Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem—0
Fast instance-specific algorithm configuration with graph neural network—0
Deep Generative Model for Mechanical System Configuration Design—0
DeepGANTT: A Scalable Deep Learning Scheduler for Backscatter Networks—0
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem—0
Federated Combinatorial Multi-Agent Multi-Armed Bandits—0
GFPack++: Improving 2D Irregular Packing by Learning Gradient Field with Attention—0
Fewer Truncations Improve Language Modeling—0
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem—0
Finding Support Examples for In-Context Learning—0
GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure—0
First-Order Bayesian Regret Analysis of Thompson Sampling—0
Graph Neural Networks for Job Shop Scheduling Problems: A Survey—0
First-order regret bounds for combinatorial semi-bandits—0
GreedyPrune: Retenting Critical Visual Token Set for Large Vision Language Models—0
Fixed Priority Global Scheduling from a Deep Learning Perspective—0
Deep Dynamic Attention Model with Gate Mechanism for Solving Time-dependent Vehicle Routing Problems—0
DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter—0
A topological analysis of the space of recipes—0
DeepCO: Offline Combinatorial Optimization Framework Utilizing Deep Learning—0
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
Deep Causal Learning: Representation, Discovery and Inference—0
Show:102550
← PrevPage 20 of 52Next →

No leaderboard results yet.