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 226–250 of 1277 papers

TitleStatusHype
Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology—0
Cheaper and Better: Selecting Good Workers for Crowdsourcing—0
The Curious Case of Class Accuracy Imbalance in LLMs: Post-hoc Debiasing via Nonlinear Integer Programming—0
CoCo: Learning Strategies for Online Mixed-Integer Control—0
Annealed Training for Combinatorial Optimization on Graphs—0
Chases and Escapes, and Optimization Problems—0
Combinatorial Keyword Recommendations for Sponsored Search with Deep Reinforcement Learning—0
Differentiable Combinatorial Losses through Generalized Gradients of Linear Programs—0
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards—0
Combinatorial optimization and reasoning with graph neural networks—0
CHARME: A chain-based reinforcement learning approach for the minor embedding problem—0
Annealed Mean Field Descent Is Highly Effective for Quadratic Unconstrained Binary Optimization—0
Combinatorial Optimization for All: Using LLMs to Aid Non-Experts in Improving Optimization Algorithms—0
A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor Design—0
Charged particle tracking with quantum annealing-inspired optimization—0
Assessing Distribution Network Flexibility via Reliability-based P-Q Area Segmentation—0
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem—0
Combinatorial optimization solving by coherent Ising machines based on spiking neural networks—0
Combinatorial Optimization via LLM-driven Iterated Fine-tuning—0
Characterization of Locality in Spin States and Forced Moves for Optimizations—0
Chaos inspired Particle Swarm Optimization with Levy Flight for Genome Sequence Assembly—0
An Introduction to Quantum Machine Learning for Engineers—0
A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles—0
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
CCJA: Context-Coherent Jailbreak Attack for Aligned Large Language Models—0
Show:102550
← PrevPage 10 of 52Next →

No leaderboard results yet.