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 1051–1100 of 1277 papers

TitleStatusHype
Preference-Based Gradient Estimation for ML-Guided Approximate Combinatorial Optimization—0
Preference Conditioned Neural Multi-objective Combinatorial Optimization—0
Preference-Driven Multi-Objective Combinatorial Optimization with Conditional Computation—0
Preference Elicitation for Multi-objective Combinatorial Optimization with Active Learning and Maximum Likelihood Estimation—0
Preference Optimization for Combinatorial Optimization Problems—0
Primal-dual algorithm for contextual stochastic combinatorial optimization—0
Principled Graph Matching Algorithms for Integrating Multiple Data Sources—0
Proposed modified computational model for the amoeba-inspired combinatorial optimization machine—0
Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches—0
Provable Non-Convex Optimization and Algorithm Validation via Submodularity—0
Pruning Random Forests for Prediction on a Budget—0
PSO and the Traveling Salesman Problem: An Intelligent Optimization Approach—0
QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks—0
QAOA-PCA: Enhancing Efficiency in the Quantum Approximate Optimization Algorithm via Principal Component Analysis—0
QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems—0
Quadratically constrained quadratic programming for classification using particle swarms and applications—0
Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features—0
Quantum Annealing for Single Image Super-Resolution—0
Quantum-Based Combinatorial Optimization for Optimal Sensor Placement in Civil Structures—0
quantum Case-Based Reasoning (qCBR)—0
Quantum Computing and AI: Perspectives on Advanced Automation in Science and Engineering—0
Lagrange Oscillatory Neural Networks for Constraint Satisfaction and OptimizationCode0
Large Language Model Assisted Adversarial Robustness Neural Architecture SearchCode0
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment ProblemCode0
Differentiable Model Selection for Ensemble LearningCode0
All-to-all reconfigurability with sparse and higher-order Ising machinesCode0
Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation AlgorithmCode0
A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over GraphsCode0
Scalable Robust Kidney ExchangeCode0
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set ProgrammingCode0
Neural Improvement Heuristics for Graph Combinatorial Optimization ProblemsCode0
Neural Knapsack: A Neural Network Based Solver for the Knapsack ProblemCode0
An Efficient Combinatorial Optimization Model Using Learning-to-Rank DistillationCode0
Latent Guided Sampling for Combinatorial OptimizationCode0
A GREAT Architecture for Edge-Based Graph Problems Like TSPCode0
LAWS: Look Around and Warm-Start Natural Gradient Descent for Quantum Neural NetworksCode0
Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language ModelsCode0
COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial ProblemsCode0
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence ModelCode0
Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential HeuristicsCode0
Joint Graph Decomposition and Node Labeling: Problem, Algorithms, ApplicationsCode0
Walkability Optimization: Formulations, Algorithms, and a Case Study of TorontoCode0
Learning-Based Heuristic for Combinatorial Optimization of the Minimum Dominating Set Problem using Graph Convolutional NetworksCode0
An ant colony optimization algorithm for job shop scheduling problemCode0
Neural Set Function Extensions: Learning with Discrete Functions in High DimensionsCode0
Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet ControlCode0
Neural Solver Selection for Combinatorial OptimizationCode0
Learning Interpretable Error Functions for Combinatorial Optimization Problem ModelingCode0
Automatic and effective discovery of quantum kernelsCode0
Learning Combinatorial Optimization Algorithms over GraphsCode0
Show:102550
← PrevPage 22 of 26Next →

No leaderboard results yet.