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 351–400 of 1277 papers

TitleStatusHype
Global Optimal Path-Based Clustering AlgorithmCode0
Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman ProblemsCode0
Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set MatchingCode0
Differentiable TAN Structure Learning for Bayesian Network ClassifiersCode0
Controlling Continuous Relaxation for Combinatorial OptimizationCode0
Futureproof Static Memory PlanningCode0
Graph Adversarial Immunization for Certifiable RobustnessCode0
FIS-ONE: Floor Identification System with One Label for Crowdsourced RF SignalsCode0
Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex NetworksCode0
Fast Parallel Algorithms for Statistical Subset Selection ProblemsCode0
FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social NetworksCode0
A random-key GRASP for combinatorial optimizationCode0
Differentiating Through Integer Linear Programs with Quadratic Regularization and Davis-Yin SplittingCode0
FALCON: FLOP-Aware Combinatorial Optimization for Neural Network PruningCode0
Balanced Crossover Operators in Genetic AlgorithmsCode0
Contrastive Losses and Solution Caching for Predict-and-OptimizeCode0
Cons-training Tensor Networks: Embedding and Optimization Over Discrete Linear ConstraintsCode0
Fast Graph-Cut Based Optimization for Practical Dense Deformable Registration of Volume ImagesCode0
Formulating Neural Sentence Ordering as the Asymmetric Traveling Salesman ProblemCode0
Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies ReconstructionCode0
Exploratory Combinatorial Optimization with Reinforcement LearningCode0
DistrictNet: Decision-aware learning for geographical districtingCode0
Optimal Intermittent Particle FilterCode0
Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based SamplingCode0
Constrained optimization under uncertainty for decision-making problems: Application to Real-Time Strategy gamesCode0
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problemsCode0
A GREAT Architecture for Edge-Based Graph Problems Like TSPCode0
Exact-K Recommendation via Maximal Clique OptimizationCode0
Bayesian Optimization of Functions over Node Subsets in GraphsCode0
ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search SpacesCode0
An Efficient Combinatorial Optimization Model Using Learning-to-Rank DistillationCode0
Approximation Algorithms for Combinatorial Optimization with PredictionsCode0
Estimating the stability number of a random graph using convolutional neural networksCode0
Evaluate Quantum Combinatorial Optimization for Distribution Network ReconfigurationCode0
Fair Correlation ClusteringCode0
Enriching Documents with Compact, Representative, Relevant Knowledge GraphsCode0
Differentiable Model Selection for Ensemble LearningCode0
Entropy-Guided Sampling of Flat Modes in Discrete SpacesCode0
Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation AlgorithmCode0
Graph Neural Networks for the Offline Nanosatellite Task Scheduling ProblemCode0
EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization FormulationsCode0
Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman ProblemCode0
Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language ModelsCode0
Ecole: A Library for Learning Inside MILP SolversCode0
Regret in Online Combinatorial OptimizationCode0
Regularized Langevin Dynamics for Combinatorial OptimizationCode0
Efficient Combinatorial Optimization via Heat DiffusionCode0
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise ConstraintsCode0
Graph-SCP: Accelerating Set Cover Problems with Graph Neural NetworksCode0
Prompt Learning for Generalized Vehicle RoutingCode0
Show:102550
← PrevPage 8 of 26Next →

No leaderboard results yet.