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 501–525 of 1277 papers

TitleStatusHype
Self-averaging of digital memcomputing machinesCode0
Quantum HyperNetworks: Training Binary Neural Networks in Quantum SuperpositionCode1
Efficient correlation-based discretization of continuous variables for annealing machines—0
A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles—0
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial OptimizationCode1
Unsupervised Learning for Combinatorial Optimization Needs Meta-LearningCode0
Mathematical Models and Reinforcement Learning based Evolutionary Algorithm Framework for Satellite Scheduling Problem—0
PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching—0
A machine learning framework for neighbor generation in metaheuristic search—0
A Local Optima Network View of Real Function Fitness Landscapes—0
Local Branching Relaxation Heuristics for Integer Linear Programs—0
Learning to repeatedly solve routing problems—0
Security Defense of Large Scale Networks Under False Data Injection Attacks: An Attack Detection Scheduling Approach—0
Walkability Optimization: Formulations, Algorithms, and a Case Study of TorontoCode0
Efficient Optimization with Higher-Order Ising Machines—0
Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural NetworksCode0
Reinforcement Learning for Multi-Truck Vehicle Routing Problems—0
Fast Hyperparameter Tuning for Ising Machines—0
Reinforced Genetic Algorithm for Structure-based Drug DesignCode1
Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls—0
Learning Branching Heuristics from Graph Neural Networks—0
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial OptimizationCode1
Arbitrarily Large Labelled Random Satisfiability Formulas for Machine Learning Training—0
Optimal Discrete Beamforming of RIS-Aided Wireless Communications: An Inner Product Maximization ApproachCode1
Deep Causal Learning: Representation, Discovery and Inference—0
Show:102550
← PrevPage 21 of 52Next →

No leaderboard results yet.