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 1101–1125 of 1277 papers

TitleStatusHype
Deep Auto-Deferring Policy for Combinatorial Optimization—0
Deep Causal Learning: Representation, Discovery and Inference—0
DeepCO: Offline Combinatorial Optimization Framework Utilizing Deep Learning—0
DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter—0
Deep Dynamic Attention Model with Gate Mechanism for Solving Time-dependent Vehicle Routing Problems—0
DeepGANTT: A Scalable Deep Learning Scheduler for Backscatter Networks—0
Deep Generative Model for Mechanical System Configuration Design—0
Deep Learning based Antenna Selection and CSI Extrapolation in Massive MIMO Systems—0
Deep Learning of Graph Matching—0
Deep memetic models for combinatorial optimization problems: application to the tool switching problem—0
Deep Momentum Uncertainty Hashing—0
Deep reinforced learning heuristic tested on spin-glass ground states: The larger picture—0
Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems—0
Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch—0
Deep Reinforcement Learning for Modelling Protein Complexes—0
Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer—0
Deep Reinforcement Learning for Traveling Purchaser Problems—0
Reinforcement Learning in Practice: Opportunities and Challenges—0
DeepSimplex: Reinforcement Learning of Pivot Rules Improves the Efficiency of Simplex Algorithm in Solving Linear Programming Problems—0
Density Maximization in Context-Sense Metric Space for All-words WSD—0
Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint—0
Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization—0
Design Space Exploration as Quantified Satisfaction—0
Detecting Overlapping Temporal Community Structure in Time-Evolving Networks—0
Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem—0
Show:102550
← PrevPage 45 of 52Next →

No leaderboard results yet.