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 401–450 of 1277 papers

TitleStatusHype
Efficient Combinatorial Optimization via Heat DiffusionCode0
Blackout DIFUSCOCode0
Combining Learned Representations for Combinatorial Optimization—0
Application of Decision Tree Classifier in Detection of Specific Denial of Service Attacks with Genetic Algorithm Based Feature Selection on NSL-KDD—0
Combinatorial Topic Models using Small-Variance Asymptotics—0
Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks—0
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation—0
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection—0
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing—0
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)—0
Combinatorial Optimization via LLM-driven Iterated Fine-tuning—0
Combinatorial optimization solving by coherent Ising machines based on spiking neural networks—0
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover—0
Combinatorial optimization for low bit-width neural networks—0
Ant Colony Optimization and Hypergraph Covering Problems—0
A Generative Neural Annealer for Black-Box Combinatorial Optimization—0
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem—0
Combinatorial Optimization for All: Using LLMs to Aid Non-Experts in Improving Optimization Algorithms—0
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem—0
Combinatorial optimization and reasoning with graph neural networks—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
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards—0
Differentiable Combinatorial Losses through Generalized Gradients of Linear Programs—0
Combinatorial Keyword Recommendations for Sponsored Search with Deep Reinforcement Learning—0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning—0
A General Large Neighborhood Search Framework for Solving Integer Linear Programs—0
A Comparison of Greedy and Optimal Assessment of Natural Language Student Input Using Word-to-Word Similarity Metrics—0
CoCo: Learning Strategies for Online Mixed-Integer Control—0
A Novel Column Generation Heuristic for Airline Crew Pairing Optimization with Large-scale Complex Flight Networks—0
The Curious Case of Class Accuracy Imbalance in LLMs: Post-hoc Debiasing via Nonlinear Integer Programming—0
A novel channel pruning method for deep neural network compression—0
Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology—0
Clustering Binary Data by Application of Combinatorial Optimization Heuristics—0
An Optimal Quadratic Approach to Monolingual Paraphrase Alignment—0
Exact and Approximate Hierarchical Clustering Using A*—0
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms—0
Evolution as a Service: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization—0
Annealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization—0
A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms—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
Evolutionary RL for Container Loading—0
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits—0
Chemical Reaction Optimization for the Set Covering Problem—0
Evolutionary Construction of Perfectly Balanced Boolean Functions—0
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives—0
Show:102550
← PrevPage 9 of 26Next →

No leaderboard results yet.