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–1075 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
Show:102550
← PrevPage 43 of 52Next →

No leaderboard results yet.