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

TitleStatusHype
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem—0
Ant Colony Optimization and Hypergraph Covering Problems—0
Combinatorial optimization for low bit-width neural networks—0
Continuous Tensor Relaxation for Finding Diverse Solutions in Combinatorial Optimization Problems—0
Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding—0
Convergence and Running Time of Time-dependent Ant Colony Algorithms—0
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem—0
An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem—0
A Generative Graph Method to Solve the Travelling Salesman Problem—0
A General Large Neighborhood Search Framework for Solving Integer Linear Programs—0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning—0
A Comparison of Greedy and Optimal Assessment of Natural Language Student Input Using Word-to-Word Similarity Metrics—0
Context-Aware Online Adaptation of Mixed Reality Interfaces—0
A Novel Column Generation Heuristic for Airline Crew Pairing Optimization with Large-scale Complex Flight Networks—0
A novel channel pruning method for deep neural network compression—0
A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms—0
An Optimal Quadratic Approach to Monolingual Paraphrase Alignment—0
Annealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization—0
A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem—0
A 10.8mW Mixed-Signal Simulated Bifurcation Ising Solver using SRAM Compute-In-Memory with 0.6us Time-to-Solution—0
Continuous Latent Search for Combinatorial Optimization—0
Cool-Fusion: Fuse Large Language Models without Training—0
Chemical Reaction Optimization for the Set Covering Problem—0
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions—0
Clustering Binary Data by Application of Combinatorial Optimization Heuristics—0
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 5 of 26Next →

No leaderboard results yet.