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 951–975 of 1277 papers

TitleStatusHype
Ants can orienteer a thief in their robberyCode0
Gumbel-softmax-based Optimization: A Simple General Framework for Optimization Problems on Graphs—0
A General Large Neighborhood Search Framework for Solving Integer Linear Programs—0
Diseño e implementación de una meta-heurística multi-poblacional de optimización combinatoria enfocada a la resolución de problemas de asignación de rutas a vehículos—0
Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization—0
Real-World Airline Crew Pairing Optimization: Customized Genetic Algorithm versus Column Generation Method—0
Reinforcement Learning for Combinatorial Optimization: A Survey—0
Ising-based Consensus Clustering on Specialized Hardware—0
Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective—0
The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery—0
Sparse Optimization for Green Edge AI Inference—0
Learning Interpretable Error Functions for Combinatorial Optimization Problem ModelingCode0
Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm—0
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives—0
Fair Correlation ClusteringCode0
Accelerating Quantum Approximate Optimization Algorithm using Machine Learning—0
Bayesian Meta-Prior Learning Using Empirical Bayes—0
WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle—0
A Class of Linear Programs Solvable by Coordinate-Wise Minimization—0
On the Performance of Metaheuristics: A Different Perspective—0
Discrete graphical models -- an optimization perspective—0
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem—0
Implementing a GPU-based parallel MAX-MIN Ant SystemCode0
Graph Ordering: Towards the Optimal by Learning—0
Parameterized Complexity Analysis of Randomized Search Heuristics—0
Show:102550
← PrevPage 39 of 52Next →

No leaderboard results yet.