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 326–350 of 1277 papers

TitleStatusHype
Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Design—0
A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP—0
Analysis of Quality Diversity Algorithms for the Knapsack Problem—0
Addressing The Knapsack Challenge Through Cultural Algorithm Optimization—0
Reinforcement Learning in Practice: Opportunities and Challenges—0
A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks—0
Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning—0
Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization—0
Deep Reinforcement Learning for Traveling Purchaser Problems—0
Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer—0
Deep Reinforcement Learning for Modelling Protein Complexes—0
DeepSimplex: Reinforcement Learning of Pivot Rules Improves the Efficiency of Simplex Algorithm in Solving Linear Programming Problems—0
A Unified Pre-training and Adaptation Framework for Combinatorial Optimization on Graphs—0
Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch—0
A Two-stage Framework and Reinforcement Learning-based Optimization Algorithms for Complex Scheduling 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
A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem—0
Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization—0
Design Space Exploration as Quantified Satisfaction—0
Accelerating E-Commerce Search Engine Ranking by Contextual Factor Selection—0
Detecting Overlapping Temporal Community Structure in Time-Evolving Networks—0
Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem—0
Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems—0
Deep reinforced learning heuristic tested on spin-glass ground states: The larger picture—0
Show:102550
← PrevPage 14 of 52Next →

No leaderboard results yet.