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 526–550 of 1277 papers

TitleStatusHype
End-to-End Pareto Set Prediction with Graph Neural Networks for Multi-objective Facility Location—0
End-to-End Efficient Representation Learning via Cascading Combinatorial Optimization—0
Budgeted Influence Maximization for Multiple Products—0
An Expandable Machine Learning-Optimization Framework to Sequential Decision-Making—0
A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization—0
A Class of Linear Programs Solvable by Coordinate-Wise Minimization—0
Embed and Project: Discrete Sampling with Universal Hashing—0
Efficient Training of Multi-task Combinarotial Neural Solver with Multi-armed Bandits—0
Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization—0
Efficient Optimization with Higher-Order Ising Machines—0
Brain-inspired Chaotic Graph Backpropagation for Large-scale Combinatorial Optimization—0
Efficient Optimization Accelerator Framework for Multistate Ising Problems—0
Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent—0
Efficient learning by implicit exploration in bandit problems with side observations—0
Bottleneck potentials in Markov Random Fields—0
A new neighborhood structure for job shop scheduling problems—0
A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique—0
Efficient LDPC Decoding using Physical Computation—0
Boosting Combinatorial Problem Modeling with Machine Learning—0
Efficient correlation-based discretization of continuous variables for annealing machines—0
Boosting Ant Colony Optimization via Solution Prediction and Machine Learning—0
A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice—0
Decomposed Quadratization: Efficient QUBO Formulation for Learning Bayesian Network—0
Efficient Combinatorial Optimization for Word-level Adversarial Textual Attack—0
Efficient Algorithms for Adversarial Contextual Learning—0
Show:102550
← PrevPage 22 of 52Next →

No leaderboard results yet.