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 1001–1025 of 1277 papers

TitleStatusHype
A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing—0
Graph Neural Networks for Maximum Constraint SatisfactionCode1
Global Optimal Path-Based Clustering AlgorithmCode0
Gumbel-softmax Optimization: A Simple General Framework for Combinatorial Optimization Problems on Graphs—0
AED: An Anytime Evolutionary DCOP Algorithm—0
Exploratory Combinatorial Optimization with Reinforcement LearningCode0
Combining Learned Representations for Combinatorial Optimization—0
Story-oriented Image Selection and Placement—0
Automated quantum programming via reinforcement learning for combinatorial optimizationCode0
Charged particle tracking with quantum annealing-inspired optimization—0
Combinatorial Keyword Recommendations for Sponsored Search with Deep Reinforcement Learning—0
DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter—0
Online learning for min-max discrete problems—0
Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location—0
Highly parallel algorithm for the Ising ground state searching problem—0
Reinforcement Learning with Chromatic Networks for Compact Architecture Search—0
A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice—0
Thompson Sampling for Combinatorial Network Optimization in Unknown Environments—0
Co-training for Policy LearningCode0
Convergence Rates of Smooth Message Passing with Rounding in Entropy-Regularized MAP Inference—0
Forecasting high-dimensional dynamics exploiting suboptimal embeddings—0
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction—0
Submodular Batch Selection for Training Deep Neural NetworksCode0
Reinforcement Learning Driven Heuristic Optimization—0
Curriculum Learning for Cumulative Return MaximizationCode0
Show:102550
← PrevPage 41 of 52Next →

No leaderboard results yet.