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

TitleStatusHype
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment ProblemCode0
Implementing a GPU-based parallel MAX-MIN Ant SystemCode0
DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean OptimizationCode0
All-to-all reconfigurability with sparse and higher-order Ising machinesCode0
How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman ProblemCode0
Differentiable Quadratic Optimization For The Maximum Independent Set ProblemCode0
A Survey and Analysis of Evolutionary Operators for PermutationsCode0
Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement LearningCode0
Implementation of digital MemComputing using standard electronic componentsCode0
Decision-Focused Learning to Predict Action Costs for PlanningCode0
Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies ReconstructionCode0
Graph Adversarial Immunization for Certifiable RobustnessCode0
Graph-SCP: Accelerating Set Cover Problems with Graph Neural NetworksCode0
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and ApplicationsCode0
Intelligent Channel Allocation for IEEE 802.11be Multi-Link Operation: When MAB Meets LLMCode0
Interferometric Neural NetworksCode0
Global Optimal Path-Based Clustering AlgorithmCode0
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial OptimizationCode0
Genetic Algorithm with Innovative Chromosome Patterns in the Breeding ProcessCode0
Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman ProblemsCode0
Curriculum learning for multilevel budgeted combinatorial problemsCode0
MGNN: Graph Neural Networks Inspired by Distance Geometry ProblemCode0
Curriculum Learning for Cumulative Return MaximizationCode0
Deep Learning as a Mixed Convex-Combinatorial Optimization ProblemCode0
Formulating Neural Sentence Ordering as the Asymmetric Traveling Salesman ProblemCode0
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence ModelCode0
Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex NetworksCode0
Coupled Input-Output Dimension Reduction: Application to Goal-oriented Bayesian Experimental Design and Global Sensitivity AnalysisCode0
Co-training for Policy LearningCode0
AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUsCode0
FIS-ONE: Floor Identification System with One Label for Crowdsourced RF SignalsCode0
Futureproof Static Memory PlanningCode0
Lagrange Oscillatory Neural Networks for Constraint Satisfaction and OptimizationCode0
FALCON: FLOP-Aware Combinatorial Optimization for Neural Network PruningCode0
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise ConstraintsCode0
Fair Correlation ClusteringCode0
FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social NetworksCode0
Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set MatchingCode0
Exploratory Combinatorial Optimization with Reinforcement LearningCode0
Controlling Continuous Relaxation for Combinatorial OptimizationCode0
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problemsCode0
Differentiating Through Integer Linear Programs with Quadratic Regularization and Davis-Yin SplittingCode0
Estimating the stability number of a random graph using convolutional neural networksCode0
ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search SpacesCode0
Learning Interpretable Error Functions for Combinatorial Optimization Problem ModelingCode0
Destroy and Repair Using Hyper Graphs for RoutingCode0
Evaluate Quantum Combinatorial Optimization for Distribution Network ReconfigurationCode0
Entropy-Guided Sampling of Flat Modes in Discrete SpacesCode0
A random-key GRASP for combinatorial optimizationCode0
EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization FormulationsCode0
Show:102550
← PrevPage 7 of 26Next →

No leaderboard results yet.