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–225 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 Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation—0
Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization—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
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
Combinatorial Persistency Criteria for Multicut and Max-Cut—0
Combinatorial Topic Models using Small-Variance Asymptotics—0
Chemical Reaction Optimization for the Set Covering Problem—0
Cheaper and Better: Selecting Good Workers for Crowdsourcing—0
Annealed Training for Combinatorial Optimization on Graphs—0
Chases and Escapes, and Optimization Problems—0
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions—0
CHARME: A chain-based reinforcement learning approach for the minor embedding problem—0
Show:102550
← PrevPage 9 of 52Next →

No leaderboard results yet.