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 926–950 of 1277 papers

TitleStatusHype
A Graph Multi-separator Problem for Image Segmentation—0
A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning—0
A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem—0
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem—0
A Knowledge-Based Approach to Word Sense Disambiguation by distributional selection and semantic features—0
A Knowledge Representation Approach to Automated Mathematical Modelling—0
A Large Language Model-Enhanced Q-learning for Capacitated Vehicle Routing Problem with Time Windows—0
Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learning—0
Algorithms Inspired by Nature: A Survey—0
Algoritmos Genéticos Aplicado ao Problema de Roteamento de Veículos—0
A Local Optima Network View of Real Function Fitness Landscapes—0
A machine learning framework for neighbor generation in metaheuristic search—0
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem—0
A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise—0
Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems—0
A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem—0
Analysis of Quality Diversity Algorithms for the Knapsack Problem—0
Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations—0
An Approximation Algorithm for Risk-averse Submodular Optimization—0
An Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles—0
An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems—0
An Efficient Algorithm for Cooperative Semi-Bandits—0
An efficient algorithm for learning with semi-bandit feedback—0
An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm—0
An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem—0
Show:102550
← PrevPage 38 of 52Next →

No leaderboard results yet.